FDo in python and answer in 15 mins for vote

N 0 1 0 0 0 1 0 0 0 1 0 0 0 L 1 M 0 Z KLMNOPSR A 0 0 K 0 0 1 0 0 1 0 0 0 0 o 000 L 0 0 0 1 1 1 0 0 0 0 00 01 M | 0|0|0|0|1|0|0|0|olo 10 000 N 0 0 0 0 0 1 1 0 1 0 100 01 00000000000 PO P 0 0 0 0 0 1 0 1 1 0 00 000 s 0 0 0 1 0 0 0 0 0 0 00 R0 R 0 0 0 0 0 0 0 0 0 1 00 Ao 0 | 0 00 N P S 0 0 0 0 0 0 0 0 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, Z, K, M, null, L, O, P, null, null, S, null, null, R, N, A] i. Draw the binary tree. [2] ii. Write the pre-order and in-order traversal sequence of the tree. [2] iii. Convert the tree to a complete binary tree. [1]