please complete the following on netbeans Java.

please see pictures below.

thank you so much

Queue of distinct strings Abstract Concept of a quru of distinct strings Ayase of distinct string is a collection of strings with a fheicet exist ere than once is the collection. For example, the collection of strips queue with front and the only operations supporto di fare at the das www, and deletion of a string from the found Implementation of a queue of distinct strings The following class, Qevetdistinctstrings. Tepresents a queue of Gistintip import java.util.ArrayList; public class Queuedistinct strings // Overview: QueetDistinetstrings are mutable. bonded // collection of distinct string that operate in 1/ PIPO ( Pt-In-First-out) order. // The abstraction function is Wa) write the abstraction function bere 1/ 1/ The rep invariant ist // b) Write the rep invariant here // the rep private ArrayList 1/ MOOIPIES. this 1/ EFFECTS Appends the element at the end of the queue 1 if the element is not in the gece, otherwise does nothing public void enquese(String element) throws Exception element moll) throw new Exception) Iffalse items.containeet items addelement): publie String dequese) throws Exception 17 MODITIES: this // EFFECTS: Pemoves an element from the front of the queue it (itens.size() throw new Exception) return items.remove(0) publie boolean repor) // ETTECTS: Returns true if the rep invariant holds for this object; otherwise returns tale // c) Write the code for the repor() here public boolean repok() { // EFFECTS: Returns true if the rep invariant holds for this object; otherwise returns false // c) Write the code for the repok() here } Page 2 of 4 public String toString() { // EFFECTS: Returns a string that contains the strings in the // queue, the front element and the end element. Implements the abstraction function. 1/ d) Write the code for the toString() here } } Queue of distinct strings Abstract Concept of a queue of distinct strings: A queue of distinct strings. p, is a collection of strings with a front and end where a string cannot exist more than once in the collection For example, the collection of strings bisa queue with front and ender The only operations supported are addition of a string at the and known as mpw, and deletion of a string from the front known as de Implementation of a queue of distinct string: The following class. QueueintinetStringa repesenta a queue of distinct strings import java.util.ArrayList public class QueceOfDistinctstrings // Overview: QueveOfDistinetStrings are mutable, bounded 1/ collection of distinct strings that operate in W PIPO (Pirat-In-Pirst-Out) order. // The abstraction function is: // a) Write the abstraction function here 11 // 1/ The rep invariant is: // b) Write the rep invariant here Page 1 of 4 I/the rep private ArrayList