Trace the given algorithm and update the given linear list

ALGORITHM LINEARLIST$()$

$\{$

X$[10]=\{23,67,98,-12,14,88,67,99,-23,55\}$

LB $=0$

UB $=6$

FOR I $=4$ TO UB

$\{$

X$[$I$]=$ X$[$I$+1]$

$\}$

X$[$UB$]=$ X$[$LB$]+2$

$\}$

Output

$0123456789$

LB $=$

UB $=\_\_$

Calculate the running time T$($N$)$ for the given Algorithm. $($Given T$($n$)$ for the function call

find$($x$,$y$)$ is $2$N$2$

$-5$ and that of the sum$($a$,$b$,$c$)$ is N$3).$

Algorithm ABC$()$ Running Time

$\{$

Int a$,$b$,$c

float x$,$y

for$($I $=$ N to $-1)$

$\{$

c$++$

d $=$ find$($x$,$y$)$

$\}$

x $=$ sum$($a$,$b$,$c$)$

print x

$\}$

T$($n$)=$

BigO

Informal Name :