Question 15 Not yet answered Marked out of 1.00 Flag question 100 If we implement heap as min-heap, deleting root node (value 1) from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen replace the root at start Select one: a. 100 b.2 c. 17 d. 3