1.

(a) Implement maketree, setleft, and setright for right in-threaded binary trees using the sequential array representation.

(b) Implement inorder traversal for the right in-thread tree in the previous problem.

Write pseudo-code not Java for problems requiring code. You are responsible for the appropriate level of detail. For the questions asking for justification, please provide a detailed mathematically oriented discussion. A proof is not required.