Now suppose we want to find the positions of all matches. Here is a plan, using the findNext method of the preceding problem:

Allocate a partially filled array result.

While findNext returns a valid position

Insert the position to the end of result.

Copy result into an array whose length equals the number of matches.

Return that copy.

See the "Copying Arrays" subsection of the "Common Array Algorithms" section for copying an array. $($Note that if there are no matches, the Arrays.copyOf method will yield an array of length $0.)$ Complete the following code.