{1} This pmblem computes discrete logarithms. {a} Describe a Baby Step, Giant Step attack to nd I in 5'\" E 15 [mod 17}. {b} [n this exercise you will independently study the FobligHellman algorithm [Section of 1112.1 of the textbook}. Apply the PohligHellman algorithm to nd 3; in 51' a 2n [mod 47}. {c} Without using a Baby Step, lGiant- Step attack or the FobligHellman algo rithm, compute manuallyr 5\" E 27 [mod 4?}. Note: In this question, you may use sagemath to compute the in- termediate modular exponentiations that you will encounter. 1U 11" 4:31 marks Part {a} The student receives 11:} marks for a correct application of the Baby step, Giant step attack. This includes 4 marks for the creation of the two relevant lists, and 2 marks for giving the correct answer. For different levels of correctness, the student receives between '9 and {1 marks. Part [b] The student receives 1'? marks for a correct application of the Polib-Hellman algorithm. This includes 3 marks for the correct application of the algorithm to certain factors, 4 marks for giving the correct intermediate answers, 3 marks for the correct application of the Chinese remainder theorem, and 2 marks for the nal answer. For different levels of correctness, the student receives between 13 and marks. Fart {c} The student receives 4 marks for a correct- answer, with all the steps well justied. For different levels of correctness, the student receives between 3 and [1 marks