Insert Y. E.Q into the following Max-Heap tree. After insertion, trace Heap Sort algorithm to arrange the values in Alphabetical order. (10 marks) D Question 3 Assume that you want to register in a program where you need to study 8 courses The names of the courses are a, b, c, d, e, f g and h. Some courses are pre-requisite of some other course. The details are given here Course 'a' is pre-requisite of course 'e' and Course 'b' is pre-requisite of coursed Course'c is pre-requisite of course d'ande Course 'e' is prerequisite of course 'h Course T is pre-requisite of course 'e and's vi Course 'g' is pre-requisite of coursel Find the topological sorting ordering of these courses. (10 marks) Altach Fue Browse My Computer