Here we explore some practical considerations. a. To begin. several distinct linear congruence: of the form discussed in question is are found. Would it be possible for these to be found in parallel? (That is. are they independent to each other so that they can be found separately by different processors?) Explain. b. Later In quwtion lb, the system of linear congruences is solved to nd ind,(q.).. . . ,ind,(qr). Explain why this step requires signicant computing power when k is very large. c. In question 1c, sucenive powers of a are tested until a congruence ofthe appropriate form is found. Would it be possible for the testing of these powers to be done in parallel? Could this entire step be done independently to the previous steps, so in parallel with them? Explain. d. Explain how the number of congruences required in question lb is related to the \"base size\" 1:. What are the advantages of choosing a large value for fr? What are the disadvantages? e. When the base size I: is chosen optimally. the time efficiency of the index calculus turns out to be l+ollil\\/|asr-loslosr' which means it is not feasible for cryptographic-sized primes p. Explain how this information inuences your thinking about solution methods for polynomial congruences