7. Suppose the set of "valuable" problems is V, where each problem can beconsidered by human beings, and there is a bijection between V and R (realnumber). Suppose the set of all A.I. softwares is S, where each software cansolve exactly one problem. Each software can be represented as a long binarystring (machine code). Which of the following statement are true?
(A) There is a bijection between S and R.
(B) A.I. can solve all valuable problems, it just takes a long time to do it.
(C) Without other restrictions, |S| is ∞.
(D) |V|≠|S|, and |V|＞|S| 
(E) In terms of solving problems, A.I. may replace human beings someday.