Q ST U W 0 1 0 | Q10 0 0 1 P Q R S T U V W X Y P 0 1 1 0 0 0 0 0 0 0 Q 0 0 1 0 1 0 0 0 0 0 R 0 0 0 1 0 0 1 0 0 0 s 0 0 0 0 1 1 0 1 0 0 | T 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 o v0000000110 w 0 0 0 0 0 0 0 0 1 1 1 x 0 0 0 0 0 0 0 0 0 0 olololo|0|1|0|0|1|0 0 0 0 0 U 0 0 0 1 0 00 0 Y 0 a. Given the above adjacency matrix: i. Draw the equivalent adjacency list. [2] ii. Draw the equivalent graph. [2] iii. Calculate the indegree and outdegree of each vertex of the graph. [1] b. Given the array representation of a binary tree (null value means the node is empty]: [null, P, T, X, null, S, Q, U, null, null, Y, W, R, null, null, V] i. Draw the binary tree. [2] ii. Write the post-order and in-order traversal sequence of the tree. [2] iii. Convert the tree to a complete binary tree. [1]