What is a basic block and flow graph. Write the algorithm for partitioning three address code into basic blocks. Translate the following program into three address statements. Assume the matrix entries are numbers that require $16$ bytes and that matrices are stored in row major order. Construct the flow graph for your code and identify the loops in your flow graph.

for $($i $=0$; i $<$ n; i$++)$

for $($j $=0$; j $<$ n; j$++)$

if $($ j $\%2==0)$

c$[$i$][$j$]=$ c$[$i$][$j$]+1$;

else

c$[$i$][$j$]=$ c$[$i$][$j$]-1$;