Please write in Python 3, Thanks!

t; in other words, every element that was Write a recursive function max_to_end(t) that moves the largest element in a non-empty list t to the end of the list. The function must not permanently remove or add elements to in t before the function is called must be in t after the function is called. For example, if t is the list: t = [3, 2, 1, 0] then max_to_end(t) changes t so that the 3 is the last element of t and the other elements of t are o 1 , and 2 in some unspecified order. The sample solution happens to change t to t = [2, 1, 2, 3] Your function is allowed to use t.pop() to temporarily remove the last element of the list, and it is allowed to use t.append(x) or t+ [x] to add an element x to the end of the list. Your function should not use any other list methods. You cannot use functions that sort the list, nor should you implement a recursive sorting function. You may use the len function to get the length of the list. An alternative solution is to have max_to_end call a recursive helper function that uses an index or indexes. If you use this approach then you should swap elements of the list instead of using list methods to remove and add elements to the list