Write a program to compute Fibonacci numbers recursively.

The program takes one parameter

$N$ : Fibonacci numbers to compute.

The output is fib$($N$)$ the Nth number in Fibonacci sequence

a$)$ Your task is to parallelize the algorithm using the OpenMP. Use directives like task, shared, firstprivate

b$)$ Calculate work and time efficiency for your algorithm.