A HashMap with a perfect hash function can search for an item in time 0(n^2) 0(n) O(logn) 0(tau) If hm is declared as: HashMap hm = new HashMap(); the statement hm.put(\"1234\",new lnteger(1234)); associates the String \"1234\" as a key with an Integer object having a value of 1234. associates the Integer 1234 as a key with an Integer object having a value of 1234. associates the String \"1234\" as a value with an Integer object having a value of 1234. associates the Integer 1234 as a value with an String object having a value of \"1234\". If the following values are put into a HashMap as follows: french.put(\"cat,\"chat\"); french.put(\"water\",\"eau\"); french.put(\"moon\",\"lune\"); the keys will come out in the order: cat, water, moon cat, moon, water water, moon, cat the order is unknown If the following values are put into a TreeMap as follows: french.put(\"cat\",\"chat\"); french.put(\"water\",\"e3u\"); french.put(\"moon\",\"lune\"); the keys will come out in the order: cat, water, moon cat, moon, water water, moon, cat the order is unknown the following values are put into a TreeMap as follow: french.put(\"cat,\"chat\"); french.put(\"water\",\"eau\"); french.put(\"moon\",\"lune\"); the keys will come out in the order: Cat, water, moon cat, moon, water water, moon, cat the order is unknown Solution 6. D 7. A 8.D 9.B You did not mentioned what i have to answer anyway the options of the above questions are here..Thankyou .