Please who can help with this question in Java programming language and this is also the Sequence that was discussed in class

public interface Sequence extends Deque, IndexList, PositionList { /** Returns the position containing the element at the given index. */ public Position atIndex(int r) throws BoundaryViolationException; /** Returns the index of the element stored at the given position. */ public int indexOf(Position p) throws InvalidPositionException; }

thank you

1. The code part (60%) a. Use the public class NodeSequence to implement Sequence (Sequence was presented in class). b. Provide the bubble sort code using the Sequence. // O(n^2) c. Provide the merge sort code using the Sequence. // O(nlog n) d. In the main function, randomly generate a large sequence containing random integers (over 20,000), and use the two sorts to sort the Sequence and compare the efficiency by a clock. (Hint: You should have one class like public class NodeSequence extends NodePositionList implements Sequence) 1. The code part (60%) a. Use the public class NodeSequence to implement Sequence (Sequence was presented in class). b. Provide the bubble sort code using the Sequence. // O(n^2) c. Provide the merge sort code using the Sequence. // O(nlog n) d. In the main function, randomly generate a large sequence containing random integers (over 20,000), and use the two sorts to sort the Sequence and compare the efficiency by a clock. (Hint: You should have one class like public class NodeSequence extends NodePositionList implements Sequence)