The following Queue is being represented by a circular representation in an array $($front is

currently $2,$ and back is currently $6).$

Show what this representation would look like after performing the following sequence of

operations. $($show where is the Front and where is the End after each operation$)$

a$)$ enq$(q,79)$

b$)$ eng$((q,50)$

c$)$ enq$(q,45)$

$20$ points

for the following array applying apply the heap sort and show all steps. $($draw the tree in every step$)$ also

label each tree.

$12,14,5,7,3$