Examine the task graph shown below. Each task, which you can think of as an async, is labeled with its runtime. Answer the following four questions about the program's runtime. In all cases you may ignore any work scheduling or task spawning overheads.Assuming a single worker thread $($X$10$ THREADS$=1)$ what is the runtime of this program?ii$.$ What is the speedup when X$10$ THREADS$=8??$iii. If each parallel task $($Pv $=$ X ms$)$ were parallelized further to become two parallel tasks$($Qv$=\%$ ms$,$ Rv $=$ ms$)$ and again run with X$10$ NTHREADS$-8,$ what would the runtimebe? What is the speedup be relative to the previous run?? iv$.$ Why is the speedup not $2$X$?$