2. The following pseudocode describes a hybrid algorithm that mixes two of the comparison sorting algorithms we have studied in this topic. What sorting algorithms are they? A: array of numbers N: number of elements in array A function hybridSort (A, N) 1 2 3 4 5 6 T89DHZANGARREN 10 11 12 13. 14 15 16 17 18 19 20 21 22 swapped=1 pos_min=0 while (swapped) swapped=0 min=pos_min for i in range (pos_min, N-1) if(A[i+1) A[i+1]) aux=A[i] A[i]=A[i+1] A[i+1]=aux swapped=1 end for N=N-1 aux-A [min] A [min] A[pos_min] A [pos_min]=aux pos_min=pos_min+1 end while end function bubble sort and insertion sort none of the others O bubble sort and selection sort selection sort and insertion sort bubble sort and mergesort