Given two sorted arrays, your task is to merge them in a new sorted array. Write a complete program in Java that takes two stored arrays of integers, and then calls a method that merges the two sorted arrays into one array that is sorted. The method returns a new array made by merging the two input sorted arrays. Note that the input arrays can be of different sizes. Assume that the size of each input array is given. You can NOT write a sorting algorithm or apply sorting. To clarify: You cannot merge the two arrays into one and then just sort it using a sorting algorithm.

The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.

(Numerical) Given a one-dimensional array of integer numbers, write and test a function that displays the array elements in reverse order.