5. Given two sorted integer lists nums1 and nums2, merge nums 2 into nums1 as one sorted array. The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that...

Please help with the following in JAVA

Extracted text: 5. Given two sorted integer lists nums1 and nums2, merge nums 2 into nums1 as one sorted array. The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it has enough space to hold additional elements from nums2. Example 1: Input: List nums =Arrays.asList (1,2,3,0,0,0); int m = 3; List nums =Arrays.asList (2,5,6); int n=3; Output: [1,2,2,3,5,6] Example 2: Input: List nums =Arrays.asList (1); int m = 1; List nums =Arrays.asList (); int n=0; Output: [1]