Data Structure & Algorithm: Show by fully java coded examples how any two sorting algorithms work. You should test these with various array sizes and run them several times and record the execution times. At least four array sizes are recommended. 15, 20, 25, 30. It is recommended you write the classes and then demonstrate/test them using another class. Discuss the comparative efficiencies of your two chosen sorting algorithms.

Java Netbeans

​​​​​​​Can I get help with this in Java please? Thank you.

Thank you in advance  Eclipse Java program  Examine carefully the UML class diagram attached class Pet has an attribute of type java.util.Date. no specific dates are required for this attribute. compareTo(Dog) compares Dogs by weight. Create executable class TestPet : create at least one Reptile pet and display it create an array of at least four Dog pets sort the array of Dogs by weight use a foreach loop to fully display all data for all dogs sorted by weight (see sample output) Output Reptile name = Slinky, rock python, M Must be caged, crawls or slithers Not much sound, maybe a hiss, acquired Fri Feb 03 17:06:54 EST 2017   All dogs sorted by weight   Dog name = Pedro, chihuahua, M Walks on a leash, weight 14 Barks or howls, acquired Fri Feb 03 17:06:54 EST 2017   Dog name = Marley, pug, M Walks on a leash, weight 20 Barks or howls, acquired Fri Feb 03 17:06:54 EST 2017   Dog name = Sacha, beagle, F Walks on a leash, weight 25 Barks or howls, acquired Fri Feb 03 17:06:54 EST…