6. (5 points BONUS) Closure Properties: Bonus Formally proof that the class of regular languages is closed under perfect shuffle: Given two lan- guages, LA and LB over alphabet , the perfect shuffle is defined as {w | W = 2161...Q262, where Qy, E LA and bi E Le and on, be). For this to work, you can assume that each string of LA and Le has the same length, namely k