By python programming

Calc WUCUZZ20.00 Complete the python function findLargest(L) below, which accepts a list L of unique numbers, that are sorted(ascending) and rotated n times, where n is unknown, and returns the largest number in list L. Rotating list [2, 4. 5. 7. 8] one time gives us list [8, 2, 4, 5, 7], and rotating the second time gives list 7, 8, 2, 4, and so on. Try to give an O(log n) solution. Hint: One of the O(log n) solutions can be implemented using binary search and using 'first or last' element to know, the direction of searching further. holast # input: List L sorted and rotated). # out: Return the largest number in listu, def findLargest(L): # Your code goes here Sample input: 7, 8, 2, 4, 5 Sample output: 8