Indicate all the statements that are true about propositional satisfiability? $($Note:

More than one statement may be true. No points awarded if you fail to indicate all true

statements.$)$

i$.$ Truth tables is a straightforward way to solve it

ii$.$ It is intractable

iii. It can be reduced to subset$-$sum in polynomial time

iv$.$ It is well$-$known that it is not in the complexity class P