It's Urgent Please answer the question in 20 minutes. #Date Structure course

PQRSTUVWXY P11000000 P | | | | |1 ||1|0| .| 0 0 1 0 1 0 0 R0001001000 S 0000110100 T0000010000 U 0000000000 v 0 0 0 0 0 0 0 1 1 0 W 0 0 0 0 0 0 0 0 1 1 x 0 0 0 0 0 0 0 0 0 0 Y 0 0 0 0 0 1 0 0 1 0 00 0 0 0 0 0 00 0 a. Given the above adjacency matrix: Draw the equivalent adjacency list. [2] it, Draw the equivalent graph (2) ii. Calculate the indegree and outdegree of each vertex of the graph. [1] b. Given the array representation of a binary tree Inult value means the node is empty]: Inut. P. T. X, nul, S, Q. U, null null. Y. W. R. null null, VI Draw the binary tree 121 Write the post-order and in order traversal sequence of the tree ! ill. Convert the tree to a complete binary troet11