1. Start by understanding how insertion sort works and what it does to sort an array. 2. Study the given template for the class and understand how it uses Java generics to sort an array of any type that implements the interface. 3. Implement the method by following the pseudocode provided above. Students should create a copy of the input array and modify the copy in-place to produce the sorted array. 4. Test their implementation using a variety of input arrays and verify that the output is correct. 5. Encourage students to optimize their implementation by considering edge cases and identifying areas for improvement. 6. Remind students to comment their code and explain their thought process as they work through the assignment. This will help them develop their coding skills and become better problem solvers