Implement the given task, upload the code and output screenshot. A "min-heap" is also a complete binary tree. In min-heap, the root node is smaller than all the other nodes in the heap. In general, the key value of each internal node is smaller than or equal to its child nodes. Thus in an array representation of a heap, the root element will be harr[0] where "harr" is the array used to represent the heap. Implement the given below tree by using min-heap concept