I want a solution without coding

A bank requires for their customers to access their online banking accounts to provide as User Id (or user name) the last 8 digits of their bank card number, and a password with a length between 8 and 12ASCI characters, including the following restrictions (posted on their website): Pusswords must have at leas 8 characters long and at nost 12 characters long, and must iaclude at least. one character fram each of the following four charsher lypes: - Upper caseletters - A B C D EF - Lower caue lenen - ghijkl - Numbers 1234567890 - Special charicters - f it N540A&(+)=7 The remaining chanacter of the passwond must be selected from the above chanacter set (and can be from any of the chancter type). centiderred unarctptable (rith repert te the precribrd farmant) The bank also requires that cach password be changed at least once every five years. 1. Assume that 1,000,000 passwords can be tested per second, calculate the probability that a hacker can guess a paskword in the timeframe between two consecutive changes. [2\%] 2. A hacker controls a network of compromised machines (botnet) that can be used to launch the attack. The network consists of 500,000 compromised machines (bots) located in different countries around the globe. Assume that the machines have approximately the same compating capability. The hacker uses a simple strategy consisting of slicing the uscrame space in subsets of equal aize, and 2. A hacker controls a network of compromised machines (botnet) that can be used to launch the attack. The network consists of 500,000 compromised machines (bots) located in different countries around the globe. Assume that the machines have approximately the same computing capability. The hacker uses a simple strategy consisting of slicing the username space in subsets of equal size, and assigning a sabset to cach of the bots to condact the attack in parallel. Calculate the probability that a successful password guess can be obtained in the timeframe. befween two consecutive changes. Briefly comment the results [2\%]. In order to strengthen the above password scherne, the bank invessigates the following two different solutions: - Using as exponential bockoff sclicine, i e., introduces a delay of x between consecutive failod authentications. The backoff wheme begins whit a user attempis to authenticale and fails, The syctem waits Y I I lecond before reprompting for the name and asthentication data. If the user fals again, the system re-arompos after xfr seconds. After in fulurus, the syuem waits x1 - Using an exponential backoff scheme, i.e., introduces a delay of x between consecutive failed authentications. The backoff scheme begins when a uscr attempts to authenticate and fails. The system waits x0=1 second before reprompting for the name and authentication data. If the user fails again, the system re-prompts after x=x seconds. After n failures, the system waits x2t1 seconds. - Using One-Time Password (OTP) tokens. A standard token displays a variable password consisting of 6 digits. For the sake of simplicity, consider that the OTP tokens are event-based. 3. Calculate the probability of successfally breaching an online aceount for each of the above options (in the time period between 2 consecutive password changes) using the botret, i.c.: a. Standard password scheme with exponential backoff using x=1:I second for the base delay. [2\%] b. Multifactor authentication scheme combining standard password and OTP. assuming that the test frequency for (OTP. fixed password) pairs remains virtually the same as that of single password (i.e. 1,000,000 guesses/second). [2%] 4. Discuss the benefits and limitations of each solutions and indicate fin your opinion) the best option. [2\%]