Calculate the running time $T(N)$ for the given Algorithm. $($Given $T(n)$ for the function call find $(x,y)$ is $2N^2-5$ and that of the sum $(a,b,c)$ is $\{$:$N^3).$

$\backslash$table$[[$Algorithm ABC$(),$Running Time$],[\{,],[$Int a$,$b$,$c$,],[$float x$,$y$,],[$for$(1=$N to $-1),],[\{,],[$C$++,],[$d$=$ find $($x$,$y$),],[\},],[$x$=\backslash$sum $($a$,$b$,$c$),],[$print x$,],[\},],[$T$($n$)=,],[$BigO$,],[$Informal Name :$,]]$