Consider the list of keys 13,6,9,3,5,11 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. Question 2 [10 Marks] Write an algorithm for checking whether an array H[1..n] is a heap or not