i want in kotlin $-$ Given a $4\backslash$times $4$ matrix mat, the initial energy is $100.$ The task is to reach the last row of the matrix with the maximum possible energy left. The matrix can be traversed in the following way: $3.$ Finish the traversal in the last row. After stepping on a cell $($i$,$ j$),$ energy decreases by mat$[$i$][$i$]$ units. Find the maximum possible energy left at the end of the traversal. Note: The final energy can be negative. Example mat$]]=[[10,20,30,40],[60,50,20,80],[10,10,10,10][60,50,60,50]]$ Possible math: