In the constructor for the Anagrams class (Figure 11–7, line 14), the add() method is invoked many times on the Set words. If words is an Ordered List, under what circumstances will this take the...

In the constructor for the Anagrams class (Figure 11–7, line 14), the add() method is invoked many times on the Set words. If words is an Ordered List, under what circumstances will this take the largest possible amount of time (for a given number of words n)? Is this likely to occur?

Figure 11–7