olease solve using bython

Q1. Fill a text file with 100,000 random Os and Is. Starting from the beginning of the file, fill 5 matrices with the dimensions of 10x10. That means of the 100.000 digits, take the first 10 and place them in the first list. Take the 2010 and place them in the 20 list. Take the 3" 10 and place it in the 3 list. Ete. Until you do 10 lists. Compare this against our representation of and then against our representation of K as below. Referring to Q1, consider the representation of Cand K as follows For C: For K [10000000001 [10000000001 [10000000001 [10000000001 [1000000000) [1000000000] 1000000000 [1000000000) [10000100001 [10001000001 [1001000000) [1010000000) [1100000000 [11000000001 [1010000000) [10010000001 [1000100000) [10000100001 A) Find how many Cs and Ks exist in the file