Java please, I want the steps.

Write a subprogram to manipulate arrays. Write a subprogram that is given an array of integers and a given integer to search for. Scan the array for matches with the given integer and create an array of the indexes with the matching entries. To store the indexes, start with an array of the same size, but, after finishing the scan, allocate an array of just the right size, copy the contents, and return the (potentially) smaller array. For example, given the following: search array ( 101, 103, 101, 104, 105, 101, 107 ] for 101 return the following: (0, 2,5 ] (an array of exactly three elements). If there are no matches, return null