When items are stored in a HashMap, they will be added in so they are sorted by: O Value O Value, then Key OKey O Key, then Value O none of these Given a HashMap called myHashMap that has a key-value of String-String, what would the following code snippet print? for(String s : myHashMap.keySet()) System.out.println( myHashMap.get(s) ); Nothing, it wouldn't even compile O Both the keys and values O All the keys a list of nulls O All the values Given a HashMap called myHashMap that has a key-value of Integer-String, what would the following code snippet print? for(int i : myHashMap) System.out.println( i ); All the keys Nothing, it wouldn't even compile O Both the keys and values All the values Given a HashMap that contains an office phone number as the key and the professor's name as the value (example: "513-529-0334", "Mike Stahr") what happens if we try and add the following entry to the HashMap: ("513-529-0334", "Jack Ryan") O Mike Stahr is replaced with Jack Ryan O An exception is thrown O The new entry is simply added because the names are different O false is returned