Suppose that passwords are stored as follows, where there are 128 pos- sible choices for each character: If a password exceeds 16 characters, it is truncated to 16 characters. If a password is less than 16 characters, it is padded with "A" until it is exactly 16 characters. The resulting 16- character password is split into two parts, Xo and X1, where Xo consists of the first six characters and X1 consists of the last 10 characters. The password is hashed as Yo = h(Xo, So) and Y1: h(X1,S1), where So and S1 are each 64-bit salt values. The values (Yo, So) and (Yi,Si) are stored for use in password verification. a. Precisely how are (Yo, So) and (Yi, Si) used to verify an entered password? b. What is the expected work for an exhaustive search to recover one particular password (for example, the administrator's password)? c. How would you attack a password in a way that could provide a significant shortcut over an exhaustive search or a standard dic- tionary attack? Explain