<prompt> Etsa mohlala bakeng sa sebopeho sa data se fanoeng.Mokgobo  <response>: Instruction in English: Create an example for the given data structure. . Response in English: A heap is a specialized tree-based data structure commonly used as a priority queue. Here is an example of a binary max heap: 100 80 50 70 60 40 30 20 10In this max heap, the parent nodes have a greater value than their child nodes. The root node, or the node at the top, has the highest value, which is 100 in this case. When a new element is inserted into the heap, it is placed at the bottom and then bubbled up until it reaches its appropriate position. Similarly, when the root node is removed, the last element is placed at the top and then sifted down until it reaches its appropriate position. The process of bubbling up and sifting down maintains the heap property. . Response in Sesotho: Heap ke sebopeho se ikhethileng sa data se thehiloeng ho sefate se sebelisoang hangata joalo ka lethathamo la lintho tse tlang pele. Mona ke mohlala oa binary max qubu: 100 80 50 70 60 40 30 20 10 Ka qubu ena e kholo, li-node tsa motsoali li na le bohlokoa bo boholo ho feta li-node tsa bana ba bona. Node ea motso, kapa node e ka holimo, e na le boleng bo phahameng ka ho fetisisa, e leng 100 tabeng ena. Ha ntho e ncha e kenngoa ka hara qubu, e behoa ka tlase ebe e bubbled ho fihlela e fihla sebakeng sa eona se loketseng. Ka mokhoa o tsoanang, ha node ea motso e tlosoa, karolo ea ho qetela e behoa ka holimo ebe e sefeloa fatše ho fihlela e fihla sebakeng se loketseng. Mokhoa oa ho phefumoloha le ho sefa fatše o boloka thepa ea qubu. 