How many camparisons would be needed to sort an array containing 100 elements using selection sort if the original array values were already sorted a) 10,000 b) 9900 c) 4950 d) 99 e) None of Above

Please use HEASORT to sort the input array [13 9 19 3 32 14 16 39 23 5 15] (not programming)

Sorted Names Problem:Assume that you already have the bubbleSort () ans swapS() modules. Design the main() program that allows the user to enter 20 names into a String array. Sort the array in ascending (alphabetical) order and display its contents. //  The bubbleSort module accepts an array of Strings and array size//  and sorts array in ascending orderModule bubbleSort(String Ref array[], integer arraySize)    Declare Integer index1, index2        // bubblesort scores    For index1 = arraySize – 1 to 0 Step -1        For index2 = 0 to index1 – 1            If array[index2] > array[index2 + 1] Then                Call swapS(array[index2], array[index2 + 1)            End If        End For    End ForEnd Module// The swapS module accepts two String elements and swaps their contentsModule swapS(String  ref a, String  ref b)    Declare String temp    // Swap a and b    Set temp = a    Set a = b    Set b = tempEnd Module

Break down the four abstraction layers that make up TCP/IP.