Help solving these problems. I have limited time in hand. I will thumbs up . Thanks!

J A 1 0 0 0 | | |1 | | | | | | | c 1 0 A B C D E F G H I A 0 1 0 1 0 1 0 0 0 0 0 Bo B 0 0 1 0 1 0 0 0 0 0 C000 0 D 0 1 1 0 0 0 0 0 0 0 E 0 0 0 0 0 0 0 1 0 1 1 1 0 0 00 F000 0 0 0 0 0 0 0 GOOO 0 0 0 0 1 0 0 H 0 0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 1 G 0 0 0 1 H 0 0 1 0 1 0 0 0 0 0 1 0 1 0 1 J 0 0 0 0 0 0 0 00 0 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]