This is in C language. See the image below for soduku discription.

a. Manually find a 9X9 puzzle and solve it. Include both the unfilled initial puzzle and the corresponding solution puzzle in your PDF report for submission.

b. Clearly outline the steps (algorithm) for solving a 9 X 9 Soduku problem.

c. Translate the algorithm into a Pseudocode.

d. Write a c Program that implements and tests your function. Build your own test cases. Describe the choice of all data structures and the reason why.

Description of the Soduku problem It is an NxN puzzle that does not require any mathematical computations to be completed Numbers 1 to 9 should be carefully added with no repetitions according to 3 core rules. We shall work with a standard 9 X 9 puzzle for the project. Initially, it has some values already added to different blocks. Below is a sample and its corresponding solution 4 7 2618 49753 987 65 3 4 2 1 5 4 3 72 1986 27 5 9 1 8 63 42 834 2 9 76 15 971 2 65 3 4897 6 78 915 2 3 4 495 372 1 6 8 3 1 2 468 5 79 6 5 3 4 1 9 8 8 3 7 89 3 3 7 2 2 Copyright 2005 M. Feenstra, Den Haag Copyright 2005 M. Feenstra, Den Haag