#$-$Question$2$:

def find rotation$($integers$)$ i

$$Given$-$a$$list $$of monotonically increasing integers that has been rotated by an$$arbitrary

$$amount $-$X$,$ write a function to return the arbitrary retation amount X$.$

$*$ input$-$is expected to be a list of integers: $($of arbitrary length$)$ provided.$$as $$an$$ argument

$$ to the function

$*$output is an integer specifying the rotation amount

$$ see test.$$Find$\_\_$rotation$\_$example for an example of hew your code will be$.$executed$.$

$$Gradingi

$=$Magority of points are awarded for correct functionality.

$=$Full points are awarded for an efficient$/$scalable solution that$-$is$-$o $($logN$).$Note that$|$

$$the points for efficiency are $45\%$ of the overall test seore, $$don$\text{'}$t spend $-$ too much time

$$on $1$t$.$

$$return $=1$