$[$Acu$$a$,$ Lisonbee$]$ Consider the following snippet of code.

struct point$\_2$d $\{$

int $x$;

int $y$;

Color col;

$\}$;

void main$()\{$

point$\_2$d$*$ data$[5]$;

for $($int $i=$;$i<mn\; id="EditorElement\_19731259">5</mn>$;$i++)\{$

point$\_2$d timp;

tmp$.x=i$;

tmp$.y=i*i$;

data$[i]=$&$tmp$;

$\}$

for $($int $i=0$;$i<mn\; id="EditorElement\_19731090">5</mn>$;$i++)$

printf$("$Point #$\%$d: $\%$d$,\%$d$",$ i$,$ data$[$i$]x,$ data$[$i$]y)$;

$\}$

It prints the same values for $x$ and $y$ for each point$\_2$d struct due to a memory bug. Using heap $($dynamic$)$ memory allocation, fix the code above so that it works properly $(x$ and $y$ should be unique for each point$).$ You may add, change, and$/$or remove lines from the code above for your answer.