the trivial selbri conversion - identity permutation of terbri

Outputs the terbri in the standard/original/trivial order: x1 broda x2 x3 x4 x5. Useful for answering 'se'u'o' questions.

- se'u'o
*(exp!)* - selbri conversion question
- ze'ai'e
*(exp!)* - selbri conversion: permute all terbri so as to be exactly backward.
- ze'au'e
*(exp!)* - last-th conversion: switches the last terbri with the first one.
- tseingu
- x
_{1}(node in a tree graph) and x_{2}(node in the same tree graph) have an essentially unique most recent (graph-nearest) common ancestor node A such that x_{3}[nonnegative integer; li] is the minimum element of the set consisting only of d(A, x_{1)}and of d(A, x_{2)}, and such that x_{4}[integer; li] is d(A, x_{1) - d(}A, x_{2)}, where d is the graph geodesic distance (defined to be infinite if nodes are not connected in the correct direction).