Generate the first six bits generated by the Blum-Blum-Shub PRG with M = 341 using the seed 181. Only enter a string of O's and 1's. Use a calculator (or Sage!) for the calculations. Submit Problem 2 (not yet completed) List those residues among 21, 34, 38, 43, 51 that are Fermat liars modulo 55. List the residues in increasing order, separated by a comma. You should use a calculator (or Sage!) for the actual computations. Submit Problem 3 (not yet completed) List those residues among 13, 38, 72, 75, 76 that are strong liars modulo 85. List the residues in increasing order, separated by a comma. You should use a calculator (or Sage!) for the actual computations. Submit Problem 4 (not yet completed) The prime number theorem estimates that there are how many primes less than 1010? Round the estimate to the nearest integer. Submit Generate the first six bits generated by the Blum-Blum-Shub PRG with M = 341 using the seed 181. Only enter a string of O's and 1's. Use a calculator (or Sage!) for the calculations. Submit Problem 2 (not yet completed) List those residues among 21, 34, 38, 43, 51 that are Fermat liars modulo 55. List the residues in increasing order, separated by a comma. You should use a calculator (or Sage!) for the actual computations. Submit Problem 3 (not yet completed) List those residues among 13, 38, 72, 75, 76 that are strong liars modulo 85. List the residues in increasing order, separated by a comma. You should use a calculator (or Sage!) for the actual computations. Submit Problem 4 (not yet completed) The prime number theorem estimates that there are how many primes less than 1010? Round the estimate to the nearest integer. Submit