A three-heap with n elements can be stored in an array A, where A[0] contains the root of the tree. 5. Draw the three-heap that results from inserting 5, 2. 8. 3. 6.4.9, 7. n that order into an initially empty three-heap. You do not need to show the array representation of the heap. You are only required to show the final tree, although if you draw intermediate trees a)