Implement optimized C/C++ code using code optimization techniques

Consider an image to be represented as a two-dimensional matrix M, where Mi,j denotes the value of M[i][j] th pixel of M. Pixel values are triples of red, green, and blue (RGB) values. We will only consider square images. Let N denote the number of rows (or columns) of an image (NxN square image). Rows and columns are numbered, in C-style, from 0 to N-1. Given this representation, the rotate operation can be implemented as the combination of the following two matrix operations:

Transpose: For each (i,j) pair, Mi,j and Mj,i are interchanged.

Exchange rows: Row i is exchanged with row N-1-i 1)

First task is to rotate a given image counterclockwise in 90 degree. Use the model image given in the assignment folder for rotation. To do that, first transpose the image then exchange the rows. These operations are illustrated in the following figure. Notice how red pixel moved during matrix transpose and exchange rows matrix operations.

Rotate by 90 (counter-clockwise) (0,0) (0,0) Transpose Exchange Rows Figure 1. Rotation of an image by 90 degree clockwise