data structures and algorithms in java

Question 2 (4 marks) Consider the following two classes Node and circularlyLinkediit private olasa Node private int element private Node nexti ublie Node (int e, Node n) element- e next - ni return element ) public int getKlement () publie Node getNext () publie void aetNext (Node n) next-ni return next ublie claas cireularlytinkedL.iat private Node tail null private int aize 0 Add the method sum () that adds a the elements in a circular list to the circularlyLinkediiat class