Question $5(12$ points$)$

Suppose Professor YoursTruly claims that the order in which a fixed set of elements is inserted into a max$-$heap does not matter$-$ i$.$e$.,$ the same binary tree results every time. Prove or disprove the claim. $($Hint: if you think that the claim is correct, then argue why it is true, think induction. If you think that the claim is wrong, then give a small counter example$).$