Apven MAX priority queue is implemented as a heap in an array of size 15. If the current queue contains the elements 135.22. 7, 10, 15, 11 Draw the tree representation of this queue after performing the dequeue operation Solve the question on a piece of paper, then take a photo of your solution and upload it here as an image. Given a Circular queue implemented as an array of size 8, if front is equal to 4 and rear is equal to 7, and the contents of the queue are[3, 15,47, 29| draw the array representation of the circular queue showing its front and rear after the user performs all of the following operations on the queue enal24 deal enal 32 dell Draw your answer on a piece of paper, take a photo of it, and upload the photo