Implement

(a) quicksort algorithms and

(b) computing the Fibonacci numbers, respectively, both in serial and parallel.

For your parallel version, use OpenMP task and sections/section constructs respectively. Compare the performances of these 3 implementations, i.e., serial, parallel using sections/section construct, parallel using task construct, by running the programs for different problem sizes and thread numbers.

Put your results in a table like the one shown in Table 1.

Size Seq Table 1: Example table for benchmarking the performance of quicksort Par(sections/section) Par(task) 1 thread 2 threads 4 threads 1 thread 2 threads 4 threads Times(s) Time(s) Speedup Time(s) Speedup Time(s) Time(s) Speedup Time(s) Speedup 105 106 107 108