Please help me with this question in Java. TIA. Develop an implementation SequentialSearchST.java of the symbol-table API that maintains a linked list of nodes containing keys and values, keeping them in arbitrary order. Test your implementation with Index.java, and validate the hypothesis that using such an implementation for Index takes time proportional to the the product of the number of strings and the number of distinct strings in the input. --------------------------------------------------- public class BinarySearchST, Value> { private static final int INIT_SIZE = 8; private Value[] vals; // symbol table values private Key[] keys; // symbol table keys private int n = 0; // number of elements public BinarySearchST() { this(INIT_SIZE); } public BinarySearchST(int initCapacity) { vals = (Value[]) new Object[initCapacity]; keys = (Key[]) new Comparable[initCapacity]; } public boolean isEmpty() { return n == 0; } public int size() { return n; } // double the size of the arrays private void resize(int capacity) { Key[] tempk = (Key[]) new Comparable[capacity]; Value[] tempv = (Value[]) new Object[capacity]; for (int i = 0; i < n; i++) tempv[i] = vals[i]; for (int i = 0; i < n; i++) tempk[i] = keys[i]; keys = tempk; vals = tempv; } // add key-value pair public void put(Key key, Value val) { if (n >= vals.length) resize(2*n); // duplicate if (contains(key)) { int i = bsearch(key); vals[i] = val; return; } // shift key-value pairs one position to right, and add new key-value pair int i = n; while ((i > 0) && (key.compareTo(keys[i-1]) < 0)) { keys[i] = keys[i-1]; vals[i] = vals[i-1]; i--; } vals[i] = val; keys[i] = key; n++; } // does symbol table contain given key? public boolean contains(Key key) { int i = bsearch(key); return i >= 0; } // return value associated with given key, or null if no such key public Value get(Key key) { int i = bsearch(key); if (i == -1) return null; return vals[i]; } // binary search in interval [lo, hi] private int bsearch(Key key) { int lo = 0, hi = n-1; while (lo <= hi) { int mid = lo + (hi - lo) / 2; int cmp = key.compareTo(keys[mid]); if (cmp < 0) hi = mid - 1; else if (cmp > 0) lo = mid + 1; else return mid; } return -1; } // all keys, as an Iterable public Iterable keys() { Queue queue = new Queue(); for (int i = 0; i < n; i++) queue.enqueue(keys[i]); return queue; } /*************************************************************************** * Test routine. ***************************************************************************/ public static void main(String[] args) { BinarySearchST st = new BinarySearchST(); // insert some key-value pairs st.put("www.cs.princeton.edu", "128.112.136.11"); st.put("www.cs.princeton.edu", "128.112.136.35"); st.put("www.princeton.edu", "128.112.130.211"); st.put("www.math.princeton.edu", "128.112.18.11"); st.put("www.yale.edu", "130.132.51.8"); st.put("www.amazon.com", "207.171.163.90"); st.put("www.simpsons.com", "209.123.16.34"); st.put("www.stanford.edu", "171.67.16.120"); st.put("www.google.com", "64.233.161.99"); st.put("www.ibm.com", "129.42.16.99"); st.put("www.apple.com", "17.254.0.91"); st.put("www.slashdot.com", "66.35.250.150"); st.put("www.whitehouse.gov", "204.153.49.136"); st.put("www.espn.com", "199.181.132.250"); st.put("www.snopes.com", "66.165.133.65"); st.put("www.movies.com", "199.181.132.250"); st.put("www.cnn.com", "64.236.16.20"); st.put("www.iitb.ac.in", "202.68.145.210"); // search for IP addresses given URL StdOut.println("size = " + st.size()); StdOut.println(st.get("www.cs.princeton.edu")); StdOut.println(st.get("www.amazon.com")); StdOut.println(st.get("www.amazon.edu")); StdOut.println(st.get("www.yale.edu")); StdOut.println(); }}

----------------------------------------------------------------------------------------------------------------------- public class Index { public static void main(String[] args) { int minLength = Integer.parseInt(args[0]); // min length of word int minOccurrence = Integer.parseInt(args[1]); // min number of occurrences // read in the words from stdin String[] words = StdIn.readAllStrings(); // build symbol table of words and locations ST> st = new ST>(); for (int i = 0; i < words.length; i++) { String s = words[i]; if (s.length() < minLength) continue; if (!st.contains(s)) { st.put(s, new Queue()); } Queue q = st.get(s); q.enqueue(i); } for (String s : st.keys()) { Queue q = st.get(s); if (q.length() >= minOccurrence) { StdOut.println(s + ": " + q); }} } }