The concept behind this solution is:
If there is an assignment of truth values which makes that expression true.
If there is no such assignment which makes the expression true
If the expression is Tautology
Here, P => Q is nothing but –P v Q
F1: P => -P = -P v –P = -P
F1 will be true if P is false and F1 will be false when P is true so F1 is Satisfiable
F2: (P => -P) v (-P => P) which is equals to (-P v-P) v (-(-P) v P) = (-P) v (P) =
So, F1 is Satisfiable and F2 is valid
Option (a) is correct.