Show, by giving a formal construction, that the class of regular languages is closed under homomorphism. in other words, given a dfa m that recognizes b and a homomorphism f, construct a finite automaton m′ that recognizes f(b). consider the machine m′ that you constructed. is it a dfa in every case? b. show, by giving an example, that the class of non-regular languages is not closed under homomorphism.

Consider a large isothermal enclosure that is maintained at a uniform temperature of 2000 k. calculate the emissive power of the radiation that emerges from a small aperture on the enclosure surface. what is the wavelength ? , below which 10% of the emission is concentrated? what is the wavelength ? 2 above which 10% of the emission is concentrated? determine the wavelength at which maximum spectral emissive power occurs. what is the irradiation incident on a small object placed inside the enclosure?