Complete the Diamond Sort project. Following the code outline provided. I have also attached an example of what the output should look like.

Part: This part explores the development and implementation of a complex algorithm to perform a two parameter orthogonal sort with spatial coupling. The program begins with a 13 x 13 sort diamond containing 85 disks of varying diameter and hue. A rearrangement must be derived where each row includes monotonically increasing hue (color hue) from left to right and each column includes monotonically increasing diameter from top to bottom. An example diamond is shown below. In order to minimize screen usage, the diamond has been rotated counterclockwise by 45. So hue increases from the bottom and left edges to the upper and right edges. Diameter should increase from the top and left edges to the bottom and right edges. The DiamondSort data is diameter and hue are stored in static memory in a 85 elements in a 169 linear array using a packed format, where missing elements are represented as-1. The least significant six bits represents one of 64 hues (0-63) and the next least significant six bits represents diameter (0-63) Actual displayed diameters are increased by 20 to improve visibility and hue identification placed in memory through a provided routine. After initialization, the 0 unused diameter hue 12 11