Problem Statement
Given an incomplete Sudoku configuration in terms of a 9x9  2-D square matrix (mat[][])
						the task to check if the configuration has a solution or not.
						Note: an incomplete Sudoku state - that is a 0 represents empty block.
                         Example 1:
                        1
						3 0 6 5 0 8 4 0 0 
						5 2 0 0 0 0 0 0 0 
						0 8 7 0 0 0 0 3 1 
 						0 0 3 0 1 0 0 8 0 
						9 0 0 8 6 3 0 0 5 
						0 5 0 0 9 0 6 0 0 
						1 3 0 0 0 0 2 5 0 
						0 0 0 0 0 0 0 7 4 
						0 0 5 2 0 6 3 0 0
						>> 1
						Example 2:
                        1
						3 6 7 5 3 5 6 2 9 
						1 2 7 0 9 3 6 0 6 
						2 6 1 8 7 9 2 0 2 
						3 7 5 9 2 2 8 9 7 
						3 6 1 2 9 3 1 9 4 
						7 8 4 5 0 3 6 1 0 
						6 3 2 0 6 1 5 5 4 
						7 6 5 6 9 3 7 4 5 
						2 5 4 7 4 4 3 0 7 
						>> 0