C expert for OpenMP and MPI C programming

The task is to search for a palindrome string of length (n) in a two dimensional 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 1000x1000, 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.

You should include timing in the code, and two solutions using MPI and OpenMP.

thanks.