Java Programming. Please help me with all these three question. for better understanding please try not use build in function. please solve all three.it will means a lot. thanks

P6.26 Write a method public static ArrayList b) that appends one array list after another. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then append returns the array list 1 4 9 16 9 7 4 9 11 P6.27 Write a method public static ArrayList b) that merges two array lists, alternating elements from both array lists. If one array list is shorter than the other, then alternate as long as you can and then append the remaining elements from the longer array list. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then merge returns the array list 1 9 4 79 4 169 11 312 Chapter 6 Arrays and Array Lists P6.28 Write a method public static ArrayList mergeSorted(ArrayList b) that merges two sorted array lists, producing a new sorted array list. Keep an index into each array list, indicating how much of it has been processed already. Each time, append the smallest unprocessed element from either array list, then advance the index. For example, if a is 1 4 9 16 and b is 4 799 11 th en mergeSorted returns the array list 1 4 47 9 9 9 11 16 P6.26 Write a method public static ArrayList b) that appends one array list after another. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then append returns the array list 1 4 9 16 9 7 4 9 11 P6.27 Write a method public static ArrayList b) that merges two array lists, alternating elements from both array lists. If one array list is shorter than the other, then alternate as long as you can and then append the remaining elements from the longer array list. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then merge returns the array list 1 9 4 79 4 169 11 312 Chapter 6 Arrays and Array Lists P6.28 Write a method public static ArrayList mergeSorted(ArrayList b) that merges two sorted array lists, producing a new sorted array list. Keep an index into each array list, indicating how much of it has been processed already. Each time, append the smallest unprocessed element from either array list, then advance the index. For example, if a is 1 4 9 16 and b is 4 799 11 th en mergeSorted returns the array list 1 4 47 9 9 9 11 16