Question 1 Which sorting algorithm is implemented here? Question 2 What is the time complexity of this sort in the worst case? Question 3 Have a look at the array below. We are trying to do quicksort...

Question 1 Which sorting algorithm is implemented here?

Question 2What is the time complexity of this sort in the worst case?

Question 3Have a look at the array below. We are trying to do quicksort on this array to sort it in ascending order. We wrote an algorithm that always takes the middle element as pivot. How the array will look like after first iteration(write in this format: 11,12,13,14,15)Array: 812 734 689 155 667 368 964 831 167 .

Extracted text: You are given a code below: def Sort(arr): if length(arr) > 1: a = length(arr)//2 1 = arr[:a] r - arr[a:] Sort(1) Sort(r) b = c = d = 0 while b < length(1)="" and="" c="">< length(r):="" if="" 1[b]="">< r[c]:="" arr[d]="1[b]" b="" +="1" else:="" arr[d]="r[c]" c="" +="1" d="" +="1" while="" b="">< length(1):="" arr[d]="1[b]" b="" +="1" d="" +="1" while="" c="">< length(r):="" arr[d]="r[c]" c="" +="1" d="" +="1" def="" printlist(arr):="" for="" i="" in="" range(length(arr)):="" print(arr[i],="" end=" " )="">