INORDER (LTR) PREORDER (TLR) POSTORDER (LRT) TEST III. STACK OPERATION. Solve the following expressions and convert to PREFIX and POSTFIX notations. (20 points 5 points each) INFIX I^N*(F/O^R)-M*A+(T/I+O)/N (T^E^C+H)/N-O*L^(0+G*Y) PREFIX POSTFIX TEST IV. BINARY TREE OPERATION. In TEST III, convert the given INFIX expression into its equivalent binary tree. (20 points - 10 points each) Z=Z-X; Z=Y-Z; ENQUEUE (Q,Z); DEQUEUE (Q,Y); X=Y-Z; ENQUEUE (Q,Y); Value of Y? Value of X? 3rd element in the Queue? Front in the Queue? Value of X? No. of elements in the Queue? TEST II. BINARY TREE TRAVERSAL. Traverse the given tree below and find the preorder, inorder, and postorder expressions. (30 points - 5 points each) FIGURE 1 BINARY TREE INORDER (LTR) PREORDER (TLR) POSTORDER (LRT) M E T S N C U E FIGURE 2 BINARY TREE R R C C D E A R D C R N M S H

Solve 100% sure answer don't use chat gpt I have ai but not sure. Solve only 100% accuracy final answers no need guidelines no generalized answer okk just take ss and put answers for each and little explanation okkk