Trace the given algorithm and update the given linear list

ALGORITHM LINEAR LIST$()$

$\{$

$LB=0$

$UB=6$

$Z=3$

INSERT$($X$[$Z$],3)$

FORW$=1$TOZ

$\{$

INSERT$(J\text{'},3)$

DELETE$($LB$)$

$\}$

INSERT$(T\text{'}$

DELETE$($UB$-2)$

$\}$

$LB=,UB=$Answer the questions based on the conditions given $LB=0,UB=x,$ Size$($Array$)=S$ and always $xLB+3$

a$.$ How many elements are the in the list with the given scenario?

b$.$ How many elements will shift to its left when first element is removed?

c$.$ How many elements will shift to its left when last element is removed?

d$.$ What will be the maximum number of elements that can be stored in the list?

e$.$ What will be the minimum number of elements found in the list?

Trace the given algorithm and update the given linear list

FOR $W=3TOUB-1$

$\{,x[W]=x[W+1]$

$\},$

$UB-$

FORW$=UB$ TO LB$+2$ STEP$-1$