Write a code only in Java.

a$)$

Design an algorithm in pseudocode for in$-$place Insertion Sort $($implemented on anarray$),$ as discussed in class, and which is used to sort integers in increasing order.

b$)$

Implement the Insertion$-$Sort algorithm you designed in $($Part a$)$ in java language.

c$)$

Implement the in$-$place Quicksort algorithm on an array, again, used to sort integers in increasing order, where the pivot is always chosen as the last element of the list.

Note: without completing $"$a$"$ part you can not proceed $"$ b$"$ part.