Simple Matrix Function in C -- 2

Considering a matrix of 10 rows by 12 columns containing integers, do a recursive function that locates in that matrix and returns how many sequences from numbers decreasing to 1 exist from the (lin, col) position and with initial value n. It is allowed to search right, left, up and down considering the value n minus one unit. As an example, the function should work for the program below, and this program should write "Qtd Seq = 4". Note that there are 4 sequences from the number 12 to the number 1 from the line = 2, column = 6 of the matrix below, identified with bold numbers and underlines. Remember that in language C the first line is 0 and also the first hill is 0. int main () {   int mat [10] [12] = {{34,45,18,56,98,33,42,67, 6,11,40,10}                    (88.59,23,34,44,11,34,61,43, 1,3,9)                    {33,32,31,22,33,77,12,11,34,98,72,74},                    {40,50,21,17,15,52,45,10, 9,32,27,30},                    (4,14,32,11,22,33,44,65, 8,52,76,12),                    {6,13,56,91,22,45,22,18, 7,45,23,44},                    (8, 9, 20, 87, 2, 5, 56, 5, 6, 5, 4, 3)                    (12.99.23, 4, 3.81, 42, 4, 8, 4.77, 2,                    (98.97, 96.95, 38, 1, 2, 3.56, 3.56, 1),                    (3,1,7,45,93,96, 1.46, 1, 2.41,23);   printf ("Qtd Seq =% d \ n", qtdseq (mat, 2,6,12)); }