The following example shows how to convert a regular C$++$ example to use OpenMP. If data dependency exists in your for$-$loop, using "ordered" is recommended because the loop is inherently serial and cannot be parallelized directly. However, because of the strict ordering requirement, the code with OpenMP is likely to perform similarly to a serial version, and you might not see any significant performance gain from parallelization. The overhead of managing the OpenMP parallel regions could lead to worse performance compared to a simple serial loop. Explain why the parallel version's performance becomes poorer than the serial version. Also, explain if there is a way to increase the performance speed using OpenMP?

Without OpenMP $($serial version$)$

for $($int i $=1$; i $<$ N; i$++)$

$\{$

z$[1]=$ z$[1]+1[1]*$ z$[$i $-1]$;

With OpenMP $($parallel version$)$

#pragma omp parallel for ordered

for $($int i $=1$; i $<$ N; i$++)$

$\{$

$$

#pragma omp ordered

$21=22+101*21-11$

$\}$