(Write the code in java)Given 2 sorted arrays (in increasing order), find a path through the intersection that produces the maximum sum and return the maximum sum. That is, we can switch from one...

(Write the code in java)Given 2 sorted arrays (in increasing order), find a path through the intersection that produces the maximum sum and return the maximum sum. That is, we can switch from one array to another array only at common elements. If no intersection element is present, we need to take the sum of all elements from the array with greater sum. Sample Input: 6 1 5 10 15 20 25 5 2 4 5 9 15   Sample Output : 81   Explanation : We start from array 2 and take sum till 5 (sum = 11). Then we'll switch to array at element 10 and take till 15. So sum = 36. Now, no elements are left in array after 15, so we'll continue in array 1. Hence the sum is 81.