figure attempt to insert creating the holeand bubbling the hole up figure the remaining two steps to insert in previous heap /*insert item xallowing duplicates *void insertconst comparable ifcurrentsize =array size array resizearray size )/percolate up int hole ++currentsizecomparable copy xarray std::movecopy )forx arrayhole ]hole / arrayhole std::movearrayhole )arrayhole std::movearray )figure procedure to insert into binary heap