Given the first and second trees using an array-based representation: Which tree or trees is a complete tree? Which Tree is a heap? Can you explain why If you had to insert 14 into the heap based on the tree selected, what would be the steps? If you had to delete the minimum value from the heap based on the tree selected, what would be the steps? 13 21 16 24 31 19 68 65 26 32 13 21 16 6 31 19 68 65 26 32.