2. (3.15) In the algorithm shown in below, assume a decomposition such that each execution of Line 7 is a task. Draw a task-dependency graph and a task-interaction graph. Algorithm. A sample serial program to be parallelized. 1. procedure FFT_like_pattern(A, n) 2. begin 3. m := log2 n; 4. for j := 0 to m 1 do 5. k := 2j; 6. for i := 0 to n 1 do 7. A[i] := A[i] + A[i XOR 2j ]; 8. endfor 9. endfor 10. end FFT_like_pattern Show the dependency graph n=8.