If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value ofroot node after second iteration if leaf node (value 100) is chosen to replace the root at start.

• A. 2
• B. 100
• C. 17
• D. none