Suppose we have a language V$1$ generated by the regular expression P$1$ and a language V$2$ generated by the

regular expression P$2.$ Let there be a model M$1$ that accepts the language V$1$ and a model M$2$ that accepts

language V$2.$ Apply the Kleene Theorem to build a Model M$3$ that accepts all the strings that are generated

by M$1.$ M$2$ that is defined by P$1.$P$2,$ Your solution must contain a table.