Write me a java code

individual Exercise: Simplified Counting Sort

$$ Write a program that

creates an array that contains $15$ randomly generated

integers in the range $0,9,$

prints all the elements in this array on the console,

counts the occurrences of each possible value $($the

range $0,9)$ in the randomly generated array,

stores these counts in an array count with size $10,$

prints the count for each value on the console,

creates another array for storing the sorted elements in

the randomly generated array,

performs sorting $($in increasing order$)$ based on the

count of each value

a by putting each value i into the sorted array for

count $[$i$]$ times $($from $i=0$ to $i=9)$

and then prints the sorted array as shown in the

example console output given on the right.

Example Console Output:

Random Array: $3,0,5,0,7,2,8,4,8,9,1,5,8,4,5$

Count for $0$:$2$

Count for $1$: $1$

Count for $2$: $1$

Count for $3$:$1$

Count for $4$:$2$

Count for $5$: $3$

Count for $6$: $0$

Count for $7$:$1$

Count for $8$:$3$

Count for $9$: $1$

Sorted Array: $0,0,1,2,3,4,4,5,5,5,7,8,8,8,9$

DO NOT FORGET TO UPLOAD YOUR CODE AND VIDEO TO BLACKBOARD