Python exercise grade 10 Write a program that determines which dates comes earlier on the calendar. The user

may enter any number of dates. The user will enter 0/0/0 to indicate that no more dates

will be entered

Example:
Enter a date (month): 3

Enter a date (date): 6

Enter a date (year): 2008

03/06/2008

Enter a date (month): 5

Enter a date (date): 17

Enter a date (year): 2007

05/17/2007

Enter a date (month): 6

Enter a date (date): 3

Enter a date (year): 2007

06/03/2007

Enter a date (month): 0

Enter a date (date): 0

Enter a date (year): 0

5/17/2007 is the earliest date

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u ⒠` ≤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u ⒠` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp ↠a[u] 10: a[u] ↠a[`] 11: a[`] ↠temp 12: end if 13: else . 3 or more elements 14: size ↠u ⒠` + 1 15: twothirds ↠d(2 ◠size)/3e 16: g-sort-recurse(a, `, ` + twothirds ⒠1) 17: g-sort-recurse(a, u ⒠twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds ⒠1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

An endless cycle of creation and response on the internet is called

Which of the following statements best describes it careers?