For questions c and d: A string r is a prefix of a string y if a string z exists such that xzy, anod that x is a proper prefix of y if in addition xy. (c) (5pts)Show that the class of regular languages is closed under Prefix. If L is a regular language then: Prefix(L) = { w is a proper prefix of string in L} (d) (5pts) Show that the class of regular languages is closed under Min. If L is a regular language Min(L) = {w E L| no proper prefix of w is a member of L} then