[Bonus Problem 2; show your work; 4 points ] A binary tree can be represented in an array such that left-child of a node A[i] occurs at A[2 x i], and the right child of the node occurs at A[2 x i +1]. The advantage of such a scheme is that it can be represented as an array, and index of the children can be easily calculated. Another advantage is that the index of the parent node can be easily calculated. For the tree developed in Problem 1, give the corresponding array representation in the form A[1] = root node; A[2] = left-child of root-node); A[3] = right-child of root node, A[4] = |eft-chi|d(A[2]), A[5] = right-child(A[2])