Algorithm design and analysis class

I would be happy if you add some explanations for each step.

Thank you

Problem 3 Erickson 1.33, p 62 (25 points) Suppose you are given a sorted array of n distinct number that has been rotated k steps for some unknown integer k between 1 and n1. That is you are given an array A[1n] such that some prefix A[1k] is sorted in increasing order, the corresponding suffix A[k+1n] is sorted in increasing order and A[n]