Answer the following Question:
1. Complete pseudocode
2. Identify the input and the input size, n
3. Identify the elementary operation
4. Compute how many times the elementary operation is executed with respect to the input size n
5. Provide a Big-O asymptotic characterization for the algorithm's complexity
Let P be an image represented as an (n × m) 2-dimensional array of pixels. Design an algorithm that given an image P will rotate it clockwise by 90 degrees.