$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

$1.10$ points Let P be an image represented as an $($n $\backslash$times m$)2-$dimensional array of pixels.

Design and analyze an algorithm that given an image P will rotate it counter clockwise

by $90$ degrees.