This question needs explaination upto distinction level step by step

This question needs explaination upto distinction level step by step. it is related to discrete logarithms For the ElGamal cryptosystem, let the public key of Alice be (p, g, h), where p is a big prime, and g is a generator for mod p, and h=g^a. The secret key for Alice is a. Bob wants to communicate with Alice, he will encrypt the messages m₁m₂m₃ m₄... in order as specified by ElGamal and send the ciphertexts c₁c₂c₃c₄... to Alice in ordere. Eve wants to attack this encrypted communication between Alice and Bob. Assume that Eve can have one plaintext m₁,Show an attack that how Eve can recover all the encrypted c₂c₃c₄... if Bob uses a broken random number generator that only outputs a constant value, say b = 2 And One step further, if the random number generator is not broken, but it is bad in the sense that it outputs b = 2 with probability 90%, then what is the probability that Eve can recover c₂, can recover c₃, and can recover c₃c₄

•  Use the baby step, giant step method to solve 2^k = 7 mod 13