This problem computes discrete logarithms. (a) Describe a Baby Step, Giant Step attack to find a in 5* = 46 (mod 47). (b) In this exercise you will independently study the Pohlig-Hellman algorithm Apply the Pohlig-Hellman algorithm to find y in 59 = 20 (mod 47). (c) Without using a Baby Step, Giant Step attack or the Pohlig-Hellman algo- rithm, compute manually 5% = 27 (mod 47)