There are some questions asked. Don't attempted I've recently received a slew of incommplete responses, which is extremely frustrating. Please don't squander your or my time. If you are unable to answer of my questions, please disregard them. I don't want to squander my paid-for post-question time. Also, if you continue to give me incompplete answer, I will give you a thumbs down and will complain. Thank you very much.

Note that your program's output must exactly match the specs(design , style) given here for each problem to pass the instructor's test cases. Design refers to how well your code is written (i.e. is it clear, efficient, and elegant). Style refers to the readability of your code (commented, correct indentation, good variable names). Image rotation is a fundamental image-processing operation required to be performed in the areas of Computer Graphics, Computer Vision(Artificial Intelligence/Machine Learning) and Visual Analytics (Data Science). Here we will explore on ways to do a clock-wise rotation of an example bit-map representation of an image aka A Matrix. Below is the matrix : 15913261014371115481216 Our objective is to write (a) function(s) to rotate the above matrix by 90degrees clockwise which produces the matrix as below: 13141516910111256781234 We will solve the problem in two ways:- (1) [50 points] Implement the function by allocating a new nXn 2D array. Then write the rotation to it by writing the rows of the original matrix to the columns in the solution matrix such that they fit the solution requirement. Then copy the new matrix exactly the same to the original matrix so that you know for sure you have updated the original matrix to look modified. 2) [50 points] Implement the function without allocating a new nXn2D array. Hint : Perform the rotation in a layer by layer fashion - meaning - different layers can be processed independently. Also within a layer, you can exchange groups of four elements at a time to perform the rotation. Example: Send 1 to 4 's location, 4 to 16 's location, 16 to 13 's location and 13 to 1 's location. Ungraded but Important : As a comment in your code for Problem 2 , write your observation on the different solutioning methods utilized today. This week onwards your observation in a course like Data Structures should speak in terms of Time and Space Complexity. Which solution does what in terms of time and space. Which is better, which is worse. Which solution would you prefer and why? Your observation should be no more than 5 lines :)