Suppose we have the following structure (record) declaration. typedef struct int x int y; myDataT; Write a program that dynamically allocates a triangular-like 2D array of the above structure with the given number of rows denoted by N such that the first row (row 0) will have one record, second row (row 1) will have two records, and so on. The last row (row N-1) will have N records. For example, when N is 5, conceptually the 2D array will look like x-? y-? y-? y-? y-? y-? y-? y-? After allocating then memory, your program should initialize x and y fields in each cell by setting them to corresponding cells' row numbers and column numbers, respectively. So after the initialization, the above array will look like: x-0 y-0 y-1 x-2 x-2 x-2 y-2 y-2 y-2 x-3 y-l x-4 y-I y-3 x-4 y-3 y-0 y-4 Finally, your program should free up (release) the allocated memory