[Predicting LCG] Let us consider a linear congruential generator (LCG) defined in Lec. 2-1, Slide 42. For integers a, b and a prime modulus p, an LCG is defined using the following recurrence: r[i+1] = a-r[i] + b mod p. For simplicity, we assume p to be public, so that an LCG is defined by a pair of constants (a,b) such that 0