Write a code according the information given below:

 

Given a fluid matrix of size n x n, where the value at each cell represents the resistance of the fluid on the cell. Find sum of path with minimum resistance passing this fluid matrix. The path can start from any cell of the first column. The next cell needs to be a nearby cell, i.e. top right (row-1, col+1), right (row, col+1), or bottom right (row+1, col+1) if we're now at (row, col). Example 1 input: matrix = [[2,6,7],[1,5,8],[3,4,9]] output: 13 explanation: 1->5->7 or 1->4->B Example 2 input: matrix = [[0,50],[-2,49]] output: 47 explanation: -2->49 Remarks 1