1a If a binary tree were implemented in an array we would store the locations of the left and right children. The location value 0 corresponds to a null pointer. Draw the binary tree that is represented by the following array 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Kev ValueA Lchild Loc 4 15 10 0 9 00 0 11 0 7 08 013 emptyLoc-2 1b. Update the array values if an element with key "S' were inserted as the left child of the node with key