Section 2.4.4 of Chapter 2 discussed the problem of finding the kth smallest value in an array of n values. Design an algorithm that uses a min heap to solve this problem. Using the class Array Min Heap defined in Programming Problem 3, implement your algorithm as a function at the client level.
Programming Problem 3:
Implement a class of min heaps using an array. Name your class Array Min Heap.