Suppose there are 12 courses: C12, C16, C23, C31, C33, C34, C35, C42, C43, C45, C52, C51, which you have to take to finish your prestigous A) In a min-heap consisting of n elements implemented as an array. What is the worst-case time taken to find the maximum element? Justify yolur answer. B) We learnt binary heaps in the class. A 3-ary heap is a data structure where each node that has at most 3 children