For the following question part you may assume the following true fact as given: Fact: Given an NFA D1 = (Q1 201,q0,F1) that recognizes language B and an NFA D2 = (Q2,262,r0,F2) that recognizes language C, there is a way to construct an NFA that recognizes B n C. (i) Show the following statement is true: For any languages B.C, if there is a regular expression representing B and a regular expression representing C then there is a regular expression representing. keep in mind for the question above, regular languages have not been proven to be closed under intersection, only union. (ii) Prove, by induction on i, that the following statement is true for all i 1: For any languages A1,A2...Ai, if there are regular expressions describing each of them, then there is a regular expression describing A1 A2 .... Ai