Q2) Consider the following algorithm for the MP-RAM model. Draw the call di-graph corresponding to this algorithm. What is the span and work for this algorithm, given that procedures $A$, $B$, and $C$ have a time complexity of $O(\log n)$, $O(\log^2 n)$, and $O(\log \log n)$ respectively? Justify your answers.
procedure MAIN(d[1...n])
Call A(d[1..n], 1)
fork B(d[1..n], 1)
Call A(d[1..n], 2)
join
for i $\leftarrow$ 1 to n-1 do
fork C(d[1..n], i)
end for
Call C(d[1..n], n)
join
end procedure
