Consider the following statements:I. The smallest element in a max-heap is always at a leaf nodeII. The second largest element in a max-heap is always a child of the root nodeIII. A max-heap can be constructed from a binary search tree in Θ(n) timeIV. A binary search tree can be constructed from a max-heap in Θ(n) timeWhich of the above statements are TRUE?

• A. I, II and III
• B. I, II and IV
• C. I, III and IV
• D. II, III and IV