Write the symbolic statement, "p → (q ∨ ~r)" in words by choosing appropriate phrases for p, q and r.

Construct a truth table to decide if the two statements are equivalent. ~p ∧ ~q; ~(p ∨ q) TRUE FALSE

Q1. Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be:bool is_match(const char *s, const char *p) Some examples:is_match("aa","a") → falseis_match("aa","aa") → trueis_match("aaa","aa") → falseis_match("aa", "a*") → trueis_match("aa", ".*") → trueis_match("ab", ".*") → trueis_match("aab", "c*a*b") → true""" def is_match(str_a, str_b):    """Finds if `str_a` matches `str_b`     Keyword arguments:    str_a -- string    str_b -- string    """    len_a, len_b = len(str_a) + 1, len(str_b) + 1    matches = [[False] * len_b  for _ in range(len_a)]     # Match empty string with empty pattern    matches[0][0] = True     # Match empty string with .*    for i, element in enumerate(str_b[1:], 2):        matches[0][i] = matches[0][i - 2] and element == '*'     for i, char_a in enumerate(str_a, 1):…

Provide a real-world example of when you would use each by creating a pseudocode representation of the programming problem.For example: if it is raining then             take an umbrella endif if it is raining then           take an umbrella else          bring sunscreen endif Also, answer the following: What does the "then" in the clause stand for? What does the "else" stand for?

Write the following English statements using the following predicates and any needed quantifier. The domain of all variables are all at the school  S(x): x is a student F(x): is a faculty member A(x, y): x has asked y a question   Every student has asked Dr. Lee a question