Let Σ be any finite alphabet. This means that there is an injection h:Σ→N. Describe how you could use h to construct an injection from Σ∗ to T (the set T is describe in question B3). Note: Since ℓ is a bijection, T is countablet Then since you have found an injection from Σ∗ to T, it follows that 5∗ must be countable too, The set of all valid computer programs in all languages is a subset of 5∗, so there must be nal numbers that cannot be described by any passible computer program.