Student Name: 7. (30 pts) Suppose you want to design an Abstract Data Type Sequence. A Sequence object contains other objects. Clients need access to the elements, and a Sequence object should not expose its underlying data structure. There may be multiple clients that need simultaneous access. Write a Sequence class that follows the Iterator pattern. Use a partially filled array as the underlying data structure of the Sequence ADT. Write a minimum amount of code that includes classes, interfaces, and methods required by the Iterator pattern. interface/class Iterator Methods defined in the interface/class boolean hasNext Returns true if the iteration has more elements E next() Returns the next element in the iteration void remove () optional operation Student Name: 7. (30 pts) Suppose you want to design an Abstract Data Type Sequence. A Sequence object contains other objects. Clients need access to the elements, and a Sequence object should not expose its underlying data structure. There may be multiple clients that need simultaneous access. Write a Sequence class that follows the Iterator pattern. Use a partially filled array as the underlying data structure of the Sequence ADT. Write a minimum amount of code that includes classes, interfaces, and methods required by the Iterator pattern. interface/class Iterator Methods defined in the interface/class boolean hasNext Returns true if the iteration has more elements E next() Returns the next element in the iteration void remove () optional operation