The following questions need to have their answers provided: Are there any propositions in the following statements? If it is, you should use the letter P; otherwise, you should use NP. When can we expect to see the debut of your very first video blog?

link(a,b). link(a,c). link(b,c). link(b,d). link(c,d). link(d,e). link(d,f). link(e,f). link(f,g). Using The above Formulate the appropriate Prolog predicate "path(X,Y,N)" which is true if (and only if) there is a path of length "N" from node "X" to node "Y". For example, there is a path of length 2 from "a" to "d": "a->b->d", but also "a->c->d", and so "path(a,d,2)" gives "true" (two times). There is also a path of length 3 from "a" to "d": "a->b->c->d". Test this predicate out on the above network to verify whether or not it is working correctly. Once this is working correctly, note now, that e.g., "path(a,e,N)." will give multiple answers:

1. Let p, q, r, and s be propositional variables. Which of the following expressions are NOT correct formulas of propositional logic? Select all that apply. p ¬ ∧ q ∧ r p ∧ (q, r) q ∨ s ∨ q q¬r   2. Consider the propositions p: You get an A on the Logic courseq: You pass the Algorithms course. How would you write in propositional logic the natural language statement You don't get an A on the Logic course and you pass the Algorithms course ¬p → q ¬p ∧ q p ∧ ¬q q → ¬p       3. The formula p → (p ∨ q) is _____. true for two interpretations and false for the rest valid satisfiable but not valid contradictory   4.The number of interpretations of a formula with 6 propositional variables is ___.         5.The formula (p ∨ q) ∧ r and the formula _____ are logically equivalent. (p ∧ r) ∨ (q ∧ r) (p ∨ r) ∧ (q ∧ r) p ∨ (q ∧ r) (p ∨ r) ∧ (p ∨ r)       6. Determine the equivalence law used in the expression; p and q denote…

Correct and detailed answer will be Upvoted else downvoted. Thank you!