Implement the following recursive equation using DCDL:

That is, f(4) = f(1) × f(3), f(5) = f(4) × f(4), f(6) = f(3) × f(5), f(7) = f(6) × f(6), etc. You are required to use one process P i in computing f(i) and one process (P 0 ) for the user. It is assumed that each P i can only communicate with its two neighbors P i-1 and P i+1 . Demonstrate your algorithm by calculating f(6).

f(n): 2 = n = 1 n = 2 n = 3 3 f(n) = f(n-2+(-1)+1) x f(n - 1) n > 3