Your task is to search for a palindrome string of length $($n$)$ in a twodimensional matrix of random single characters between a$-$z$,$ the idea of the

solution is to parallelize the search between all possible threads and count

each occurrence. The matrix size is $1000$x$1000,$ you can input the number you

want to search or hard code it$,$ search right to left, up to down and diagonally

up to down.

Make sure to include timing to your code, you need to test using different

thread count for your search, you need to submit two solutions using MPI and

OpenMP:

$1.$ OpenMP C file and results of execution. $50\%$

$2.$ Repeat part $1$ using MPI C file and results of execution. $50\%$

Code below can be used to generate the matrix:

for$($i $=0$;i $<$ ROWS;i$++)$

for$($j $=0$;j $<$ COLUMNS;j$++)$

a$[$i$][$j$]=($rand$()\%26)+\text{'}$A$\text{'}$