Divide this piece of code into sequential and parallel sections. Identify the potential kernels in the code. Calculate the complexity of the code using a polynomial, and express this in Big O notation.

#include

#include

int main$($void$)$

$\{$

FILE $*$ fp;

fp $=$ fopen$("$centroid$\_2$d$\_$object.dat", $"$w$")$;

int N $=12$;

int i;

double x$[]=\{-1\mathrm{.}5,-0\mathrm{.}5,-0\mathrm{.}5,0\mathrm{.}5,2\mathrm{.}0,2\mathrm{.}5,1\mathrm{.}0,-1\mathrm{.}5,-2\mathrm{.}0,1\mathrm{.}0,-0\mathrm{.}5,2\mathrm{.}0\}$;

double y$[]=\{1\mathrm{.}5,1\mathrm{.}5,0\mathrm{.}5,-0\mathrm{.}5,1\mathrm{.}0,-1\mathrm{.}5,-2\mathrm{.}5,1\mathrm{.}5,2\mathrm{.}0,-2\mathrm{.}0,3\mathrm{.}0,-1\mathrm{.}5\}$;

double t$[]=\{0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001,0\mathrm{.}001\}$ ;

double l$[]=\{1,1,1,1,1,1,1,1,1,1,1,1\}$;

double w$[]=\{1,1,1,1,1,1,1,1,1,1,1,1\}$;

double A$[$N$],$V$[$N$]$;

double sumV $=0\mathrm{.}0$;

double sumVx $=0\mathrm{.}0$;

double sumVy $=0\mathrm{.}0$;

double x$\_$cg$,$y$\_$cg;

for$($i$=0$;i