psuccess

. . . Question 1 (d) Let us asssume now that the attacker can make k attempts before the vault gets blocked and alarm sounded. Use the functions psuccess (k, p) to compute his success probability if k = 7, if the attacker chooses his keys in the order given by X i.e. 1, 2, 3, - . . 24 with corresponding probabilities p = P(X). Write the code in the code chunk below and calculate the probability of success Code Start Over Run Code Question 1(e) However, not every guessor is this lucky. Permute the probability vector Pr and get a new vector p, and then find the probability of success in 7 guesses. Find the average number of guesses needed when the distribution of X is defined by pl. Code Start Over Run Code Now permute Pr twice to get another distribution p2. What is the new probability of success in 7 guesses? What is the average number of guesses for the attacker facing the key distribution p2 to be successful? Code Start Over Run Code Which of the three distributions was most beneficial to an attacker? Why