give big theta bound for the worst case runtime of matches method

publie Listccharsequences at Matches (CharSequence preti) 47 (prefix = null) { throw new NullPointerException("calls keys withPrefix } else if (prefix.length() - ) throw new Illega largumentException"prefix must have lanet 1) 1 List list = new LinkedlistcCharSequence> ; Node x = get(overaltRoot, prefix, 0); if (x == null) return list; if (x.isTerm) list.add(prefix); collect(.mid, new StringBuilder (prefix), list); return list; private Node get(Node x, CharSequence key, int d) { if (x == null) return null; char c = key.charAt(d); if (c x.data) return get(x.right, key, d); else if (d list = new LinkedlistcCharSequence> ; Node x = get(overaltRoot, prefix, 0); if (x == null) return list; if (x.isTerm) list.add(prefix); collect(.mid, new StringBuilder (prefix), list); return list; private Node get(Node x, CharSequence key, int d) { if (x == null) return null; char c = key.charAt(d); if (c x.data) return get(x.right, key, d); else if (d