Give an algorithm that $$nds an arbitrary item X in a binary heap using at most roughly $3$N$/4$ comparisons.

please write in C