Your task is to search for a in a two dimensional matrix of random single characters between a palindrome string of length (n)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. Make sure to include timing to your code 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) + 'A';

Hint: start your testing with a small matrix, 10x10 to make sure it is working, then scale

up to 1000x1000.

You can use function for the search or string libraries.

Example of execution output:

Search for 6 letters words:

47345 words found

Execution time: 24 msec using 4 threads