You are given two arrays, A and B$,$ each made of N integers. They represent a grid with N columns and $2$ rows, where A is the upper row and B is the lower row.Your task is to go from the upper$-$left cell $($represented by A$[0])$ to the bottom$-$right cell $($represented by B$[$N $-1])$ moving only right and down, so that the maximum value over which you pass is as small as possible.Write a function:class Solution $\{$ public int solution$($int$[]$ A$,$ int$[]$ B$)$; $\}$that$,$ given two arrays of integers, A and B$,$ of length N$,$ returns the maximum value on the optimal path.