Suppose an attacker obtains the hash h of some user's password. The password is hashed using SHA256. The attacker assumes that the password is exactly 9 characters long and each character can be one of 80 possible values. Suppose that the attacker can compute 10,000,000SHA256 hashes per second. The attacker tries to find the user's password by exhaustively trying all passwords of length 8 until it finds one that hashes to h. [10 points for grads/honors - possible 5 points bonus for undergrads]. a. Approximately now many seconds will it take the attacker to find the user's password in the worst case? Show your work. b. Will password salts make the attack harder? Briefly explain your answer.