pls send the correct answers only.

(as the following is the pseudocode for to a recursive algori in Binary tree lin no the Dalues stored print particular order) print Tree (BT Node t { if (!!- END { print (t. Val) print Tree lt.left) print Tree (to right) } 3 3 Give of a non-recursive the the pseudocode algorithm to print of binary freel in no. particular order) with complexity contents that is no wowe than the above recursive algorithm fint you . may che la stack Abstract Data type in the answel (6 Consider the following graph : 3 FB A 4 5 3 this graph by on Demonstrate the execution of the Tarnik prim algorithm da finding the minimal tree Spanning writing a table of the execution steps format where the is alread provided (Initial note to add hode A: Out in following first row, following intialisation, A B c ole finished 0,4 00 B 2.D . : tach vow one the a node iteration distance should show the resulte of iteration of algorithm after that is finished in that and I the remaining columns show the current of the node of that column from the tree, node that connects it to the tree and a if the node of the mark column is finished the till