String Regular Expression Assignment

Question 1 (1 point)
Which of the following are not strings in the language defined by the regular
expression
a b+ c{2} d?
(Choose all that apply)
Question 2 options:
abcd
abbccdd
abbbcc
bccd
Question 2 (1 point)
Use truth tables to determine whether the following proposition is a tautology or a
contradiction:
p => (q => p)
Truth table
p q Q=>p P=>(q=>p
)
tautology contradictio
n
T T T T T F
T F T T T F
F T F F T F
F F F F T F
P=> (q=>p) is neither a tautology nor contradiction.
Question 6 options:
Tautology
Contradiction
Question 3 (1 point)
Calculate the truth value of the following proposition:
(1 < 0) ⋀ (2 < 1)

Let (1<0) be A which is a false statement and
(2<1) be B is also a false statement
Therefore:
(A) ⋀ (B) => (F) and (F)
Which always give a false (F).
Question 7 options:
True
False
Question 4 (1 point)
Calculate the truth value of the following proposition:
(0 < 1) ⋀ (1 < 2)
Let (0<1) be A and (1 < 2) be B
A is a true statement while B is a true statement also.
Therefore:
A ⋀ B results in a true value.
Question 10 options:
True
False
Question 5 (1 point)
Which of the following are valid strings as defined by this regular expression
[bc]+at
(Choose all that apply)
Question 11 options:
cat
catbat