a$)$ Fibonacci series is recursively defined as: F$($N$)=$ F$($N$-1)+$ F$($N$-2),$ with F$(0)=0$ and F$(1)=1$

Explain the difference between dynamic programming and divide and conquer approaches using the above example, about how one would compute F$(5)$