Create a one-dimensional array of size j = 10 that holds integers. (1 point) B.

Allow the user to enter the digits in the array. (1 point)

C. Use RECURSION to implement a method public int seqSearch(int A[], int i, int j, int x) the method should return the index i of the item x in the array. If the item is not in the array, return -1. Note that: A is the array, i and j are positive integers, i <=j, and x is the item to be search for in the array A. (3 points)

D. Call your seqSearch method and print the output. (1 point)

(java code)