Question $2[10$ Marks$]$

$[5$ Marks$]$ Write an algorithm for checking whether an array H $[1..$n$]$ is a heap or not.

$[5$ Marks$]$ Determine its time efficiency.

Question $1[10$ Marks$]$

Consider the list of keys $15,8,11,5,7,13$ stored in an array:

$($A$)[4$ Marks$]$ Show various steps to sort the above list using Selection Sort. $[1$ Mark$]$ Find the number of comparisons required.

$($B$)[4$ Marks$]$ Show various steps to sort the above list using Bubble Sort. $[1$ Mark$]$ Find the number of comparisons required.