PYTHON CODE

Please give full explanation of the codes.

Please follow the number of the parameters that stated in the question, there is only (v, heap), 2 parameters, please not do more than that.

An "Introduction to the design and analysis of algorithms by A. Levitin, 3rd Edition, Section 6.4 Heaps and Heapsort, describes how a list can be used to implement a heap. The item at the top of the heap, the root node, is stored at position 0 in the list. The children (if there are any) of the item at position i in the list are at position 2 x 1 + 1 (the left child) and 2 xi + 2 (the right child). Think about how to locate the index of the parent of a given item (remembering that the item could be a left or right child). For example, the (max-)heap in Figure 1 can be represented as the list [8, 4, 7, 2, 3, 1]. Here the item at position 0 has the value 8, and has children at positions 1 and 2 with values 4 and 7 respectively. Figure 1: Heap a) Write a Python function min_child(v, heap) that takes as input a position v and a list representation of a heap, heap. It should return the index of the smaller child of v