The constructor below is very similar to the one you used for the last assignment. What Is its time complexity in terms of N, where N is the number of lines in the InputStream (the word file)? public Doublets(InputStream in) { try { lexicon = new TreeSet(); Scanner s = new Scanner(new BufferedReader(new InputStreamReader in))) while (s.hasNext()) { String str = s.next(); boolean added = lexicon.add(str); s. nextLine(); } in.close() ; } catch (java.io.IOException e) { System err.println("Error reading from InputStream."); System exit(1); } } A. log N B. N C. N log N D. N^2