Consider the following algorithm.

for

i $\{1,2,3,4,5,6\}$

do$$beep$$for

j $\{1,2,3\}$

do$$beep$$for

k $\{1,2,3,4\}$

do$$for

l $\{1,2,3,4,5\}$

do$$beep$$for

m $\{1,2,3,4\}$

do$$beep

How many times does a beep statement get executed?

$($a$)$ If x $=3$ and n $=6$ initially, what is the value of s after this segment executes?

$($b$)$ Count the number of additions this segment performs. Your answer should be in terms of x and n$.$