Can you help me with explanation, Please? Thank you.

combinatorics (randomized) You will be given several sets and asked to determine their cardinalities. For example, if the sets are A={x{0,1}6x[2,4]=010}B={f:{1,2,3,4}{0,1}}C={f:{1,2,3}{1,2,3,4}fis11}D={x{0,1}3{0,1}50(x)=#1(x)+1}E={n{10,11,,29}n}1mod3} In English, the above sets are: A= all binary strings of length 6 with substring 010 at indices 2,3,4. (Note that the length of a substring from i to j is ji+1.) B= all functions with domain {1,2,3,4} and range {0,1}. C= all 11 functions with domain {1,2,3} and range {1,2,3,4}.D= all binary strings of length 3 or 5 that have one more 0 than they do a 1 . E= all positive integers between 10 and 29 that are congruent to 1 mod 3 (i.e., the remainder is 1 after dividing by 3 ). Then A=8,B=16,C=24,D=13,E=7. Indicate this by writing these numbers one per line 81624137 Note: For the sake of understanding the problem statement, the examples given here are small, so small that you could solve the problem by brute force, simply writing down all the elements of the set. However, the sets you will be given on Gradescope will be much larger, so you will need to understand how to do this counting "algorithmically", without resorting to brute force. For example, the set A above can generalize to An,i,j={x{0,1}n x[i.j]= some string }; how would you express An,ij as a function of n,i,j ? To calculate the numbers for the answers, you will need to use an arbitrary-precision calculator, such as the Python interpreter (https://rep1it, com/languages/python3) or Wolfram Alpha (https : //www, wolframalpha, com/). A normal calculator will convert large integers to floating-point (e.g., 1.9158123e+20) but these will not work as answers; the exact integer must be entered