The truth table represents statements p, q, and r. p q r p ∧ q p ∧ r
A T T T T T
B T T F T F
C T F T F T
D T F F F F
E F T T F F
F F T F F F
G F F T F F
H F F F F F
Which rows represent when (p ∧ q) ∨ (p ∧ r) is true?

A and B
A, B, and C
B and E
B, C, and E

THE ANSWER IS A,B AND C

Step-by-step explanation:

Because v

TvT = T

TvF = T

FvT = T

FvF = F

the answer would be 150 books

step-by-step explanation:

if you divide 300 by 2 you will get 150

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol