Given the following prolong program, answer the following queries:/* comment in prolong \+ represents *not equal to */%single line comment day (''sunday''). day (''monday''). day (''tuesday''). day (''wednesday''). day (''thursday''). day (''friday''). no_office (''sunday''). no_office (''saturday''). Take_leave (''monday''). Visit_mom (x): no_office (x) | take_leave (x). interpret the queries and quess (!) the answer (s) produced by the program: day (''Holiday''). Day (x). visit_mom (x). visit_mom (x). provided you have changed the rule with this: visit_mom (x): non_office (x) take_leave (x). define a new rule "working_day (x)" to detect the days that are not holidays. Express the following statements in first order logic. You can define the predicates as you wish. Apply appropriate quantifiers for each expression. I can visit my mom every day. I can visit my mom if I have no office. I take leave some day and I can visit my mom. I can take leave if it is a working day. What is the domain for a possible predicate "day(X)