Experiment $2($PreLab task $-$ to be prepared in advance$)$

Consider the following recursive algorithm $($pseudocode$)$What would be returned if fun$1$ is called as fun$1(12)?$ Perform analysis of the problem manually, without using computer.

Experiment $3-$ to be prepared andExplained by an assiatant

$3\mathrm{.}1)$ The following programs can be used for self$-$studying for main operations$($Insertions and Deletions of integer values$))$ of Circular Queues: Run and discuss the output.