Write a program that does the following steps

$1.$ Generate an array of $50$ random integers from $0$ to $105.$ Call this array num$1\_$arr

$2.$ Generate another array of $50$ random integers from $90$ to $199.$ Call this array num$2\_$arr

$3.$ Write a void method called closestDist $($int $[]$ num$1\_$arr, intl$]$ num$2\_$arr$)$ that prints out

$$ the closest distance between the $2$ arrays and the $2$ numbers with their indices

$$ You MUST use a nested for loops inside this method to find the closest distance. Do not use any built$-$in metaods to sort the array.

$$ For example, here is a sample output

The min distance between the $2$ arrays $-15$

The $2$ numbers are:

$87$ in the first array with index $9$

$102$ in the second array with index $1$