Consider the multithreaded version of the Fibonacci algorithm.

a. Draw the computation DAG for a call to fib(5).

b. How much work (i.e., number of strands) is required to complete the computation of fib(5)?

c. How much is the span (i.e., number of nodes in the longest path) required for the computation of fib(5)?

d. What is the parallelism of the computation for fib(5)? Hint: Consider that your answer to part a. is T1 and that your answer to part b. is T.