10. (1) Heap is a complete binary tree, then what is the difference between complete binary tree and full binary tree? (5 pts) (2) Consider the following full binary tree representation for a max-heap. Give the array representation of the heap, then insert the key P into the heap and circle any entries that changed: (10 pts)