Read question carefully and answer all parts Consider the list 1, J, H, B, L, M, P, 2. Replace 1 and "2" in the list by alphabet characters without duplicating other characters already in the list. Show the list of characters after replacing number 1 and 2 by a characters of your choice. What structure is used to store Heap elements? What is the index of node B in the heap structure? Calculate the index of the left and the right child as well as the parent index of node B in the heap. Show your calculations. Describe the heapify algorithm and apply it to your list to build a Minimum Heap. Show the heap (the list) after applying the heapify algorithm. Pick an letter and describe/apply Heap insert algorithm to insert this letter into the Heap. Describe the Heap Remove from algorithm. Show the heap after applying the Remove algorithm. What is the worst case time complexity of Remove operation.