I need the codes in an hour

Instructions

Write a java program that will explain the working of a sorting algorithm for students, use any $2$of the sorting algorithms below, note i only need a test program and a single class containing code for operations of the $2$sorting algorithms and make sure the code runs, so only code the the algorthm class and test program and a screenshot to show the output.

The program must clearly show operations step by step so that students can follow and come to understand them.

write a long program for the class bucket, bubble, insertion, selection sort in a single class maybe about $80$lines of code all java files pick only $2$algorthms then write their operations in $1$ class. then write a single test program to print out the output, use the output below as reference and a guide because it is an output of only bubblesort alone but now i need a fresh code that contain atleat $2$ sorting algorithms, the code must not be that simple and uninteresting$($meaning use longer arraylist that can perform atleast morethan $5$steps$/$buckets in the output$).$

No Zipped file please

unfortunately i have to use a softwareto check for plagiarism and code similarities from the internet so that i will be able to know if this is the best program for my subscription.

Here's the output:

Original Array:

$[42,32,33,52,37,47,51,29,75,12]$

Step $1$: Create empty buckets

Bucket $0$: $[]$

Bucket $1$: $[]$

Bucket $2$: $[]$

Bucket $3$: $[]$

Bucket $4$: $[]$

Bucket $5$: $[]$

Bucket $6$: $[]$

Bucket $7$: $[]$

Bucket $8$: $[]$

Bucket $9$: $[]$

Inserting $42$ into bucket $4$

Bucket $0$: $[]$

Bucket $1$: $[]$

Bucket $2$: $[]$

Bucket $3$: $[]$

Bucket $4$: $[42]$

Bucket $5$: $[]$

Bucket $6$: $[]$

Bucket $7$: $[]$

Bucket $8$: $[]$

Bucket $9$: $[]$

Inserting $32$ into bucket $3$

Bucket $0$: $[]$

Bucket $1$: $[]$

Bucket $2$: $[]$

Bucket $3$: $[32]$

Bucket $4$: $[42]$

Bucket $5$: $[]$

Bucket $6$: $[]$

Bucket $7$: $[]$

Bucket $8$: $[]$

Bucket $9$: $[]$

$...$

Step $3$: Sort each bucket

Bucket $0$ after sorting: $[12]$

Bucket $1$ after sorting: $[29]$

Bucket $2$ after sorting: $[]$

Bucket $3$ after sorting: $[32,33,37]$

Bucket $4$ after sorting: $[42,47]$

Bucket $5$ after sorting: $[51,52]$

Bucket $6$ after sorting: $[]$

Bucket $7$ after sorting: $[75]$

Bucket $8$ after sorting: $[]$

Bucket $9$ after sorting: $[]$

Step $4$: Concatenate all buckets into the final sorted array

Sorted Array:

$[12,29,32,33,37,42,47,51,52,75]$