Your task is to design a method

int$[]$ allMatches$($int$[]$ values, int size, int a$,$ int b$)$

that returns all values between a and b inclusive in the partially filled array values. For example, if an array a contains $11,3,9,4,2,5,4,7,6,0,$ then the call allMatches$($a$,8,3,7)$ should return an array containing $3,4,5,4,7.$ Note that the $6$ is not included because it is past the size of the partially filled array.

Arrange the code below in the right order. Not all lines are useful.