Data structures, java.Thanks!

Instructions: A) Goal: To get familiar with the two most important sorting algorithms: sort and merge sort. B) Task: quick 1. Use the random method of the math class to produce a sequence of 15 integers range from 0 to 100. Print the unsorted array. 2. You should select quick sort or merge sort, which should be different from the one in your homework. That is, if you implement the quick sort algorithm in your homework, in your lab you should implement the merge sort, vice visa. 3. Show your algorithm correctness by print the sorted array