"Question $4$

Assume that a max$-$heap with

$1$

$0$

$5$

$10$

$5$

elements is stored in a complete $5-$ary tree. Approximately how many comparisons a call to

$$

$$

$$

$$

$$

$$

$($

$)$

Insert$()$ will make?

$1$ point

$8$

$28$

$38$

$18"$