7. (Note: t can be shown that the class of decidable languages is closed under union, concatenation, intersection, star and complementation operations.) (10pt Prove that the class of decidable languages is closed under the following operations (5pt each): (a) Intersection (b) Complementation. (Hint: Similar question is answered in Exercise 3.15(a) of the textbook)