1. Given an mxn grid of 0s,1s and 2s (0 denoting an obstacle, 1 denoting empty cell and 2 denoting cell with gold). Find the path used to reach from (0,0) to (m - 1, n - 1) collecting maximum gold if you are allowed to travel in any four directions and can take a maximum of k steps.\n2. Given {operator - precedence - explanation} :\n\t\t\t\ta. \'!\'         -1                    - x!y = (y - x) % 10007\n\t\t\t\tb. \'@\'       -1                    - x@y = (x + y) % 10007\n\t\t\t\tc. \'#\'        - 2                   - x#y = (x*x*y) % 10007\n\t\t\t\td. \'$\'        - 2                   - x$y = (x*y*y) % 10007\n\tOperators with higher precedence have higher priority. Operators with precedence 1 are calculated from left to right and those with precedence 2 are calculated right to left. Operations in paranthesis() have higher priority. Given an expression consisiting of the operators, paranthesis and digits, find it\'s result. \n\tEg. 1!(2$1) = 1\n\tEg. 1$2#3 = 144

Given an mxn grid of 0s,1s and 2s (0 denoting an obstacle, 1 denoting empty cell and 2 denoting cell with gold). Find the path used to reach from (0,0) to (m - 