1. a) Utilize the buildHeap function as provided in the textbook to transform the given array into a heap. Display the ultimate configuration of the array: 47, 78, 81, 52, 50, 82, 58, 42, 65, 80, 92, 53, 63, 87, 95 b) Demonstrate the array's state after a single pass of heapsort. (Apply the heapify procedure as outlined in the textbook.) 2. a) Add elements with the specified keys (in the given order) to a binary search tree that is initially empty: 30, 40, 25, 56, 45, 26, 11, 13. Illustrate the resulting tree. b) What is the result of performing a preorder traversal?