Consider the following algorithm that given an array A of length n produces an

array B where B$[$i$]$ is the sum of the $16$ elements of A following A$[$i$].$

$1$: function algorithm$($A$)$

$2$: n $$ length of A

$3$: B $$ new array of size n $16$

$4$: for i in $[0$ : n $16]$ do

$5$: B$[$i$]0$

$6$: for j in $[0$ : $16]$ do

$7$: B$[$i$]$ B$[$i$]+$ A$[$i $+$ j $+1]$

$8$: return B

Use O$-$notation to upperbound the running time of the algorithm.

pls exaplain as well