Binary search can be done on data in a sorted array or in a binary search tree. Name an advantage and a disadvantage of the array implementation over the BST implementation. How many permutations of n distinct items are there? O(n^2) Explain: selection sort is an algorithm on average. Explain: quicksort is an algorithm on average, but is an O(n^2) an algorithm worst case. Given an array containing the integers 12 9 3 6 4 1 (in that order), Show the array as it is sorted by the function selectionsort. Show the array as it is sorted by the function mergesort Show the array as it is sorted by the function insertionsort