17. Mango Blast Pro You are given two N x N matrices representing a field of mangoes say A and B. Each cell is one of three possible characters as follows. The two matrices are connected at cells (n-1,n-1) B(n-1, 0) > A(n-1, n-1) > A(0,0) > A(n-1, n-1) > B(n-1, 0) > B(0, n-1). Matrix B: there is no valid path between two touchpoints, then no mangoes can be collected & hence return 0. Input: First line contains an integer N which represents the size of the matrix. Its a square matr Next N lines carry a string which represent the row Ri in the matrix where i is [0,n-1]. Len is N btw. Constraints: 0