I need help completing this method findStrongPasswords() that receives a Map and a Set as its arguments. Please see the incomplete method below.

Complete the code for the method findStrongPasswords () that receives a Map and a Set as its arguments. You can assume that both the set and the Map will always contain at least one entry. The Map contains string type user IDs as keys with each having an associated string value that is an encrypted password. The set contains the encrypted versions of common weak passwords The method should return a SortedMap of key-value pairs representing users whose password does not appear in the set of weakPas swords 1 public SortedMap users, Set