please solve it completely

these questions needs to be answered accordingly. please solve it fast

Question 3 A . C G H J A 0 1 0 B 1 0 D E F G H I 0 1 0 1 1 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 C 0 0 0 0 0 0 1 0 0 0 Do | 1/1 10 10 10 10 10 10 10 E 000000110 0 0 0 0 0 0 0 0 0 0 0 0 0 D 0 0 LL F 0 0 0 0 0 G 0 0 0 0 0 1 0 0 0 1 H 0 0 0 0 0 0 0 0 1 1 0 1 0 1 0 0 0 0 0 0 1 0 1 0 1 1 0 0 0 1 J 0 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, A, E, H, D, null, B, F, I, C, null , null, null, G, J, null] i. Draw the binary tree. [2] ii. Write the pre-order and post-order traversal sequence of the tree. [2] iii. Convert the tree to a complete binary tree. [1]