Try this format for easier solution
((p→q)∧(q→r))→(p→r)
now to check tautology , we just need to make the given equation false for 1 case
that is possible only if LHS of implication is TRUE and RHS of implication is FALSE
Lets make RHS True first
so take p = True and r = false
so p->r becomes false
now for q = true and q= false , check the whole implication
for q = true
((p→q)∧(q→r))→(p→r)
((T→T)∧(T→F)) →(T→F)
= T
for q = false
((p→q)∧(q→r))→(p→r)
((T→F)∧(F→F)) →(T→F)
= T
So we can say its a Tautology
similarly to check Contradiction , we can check for 1 case where given equation is TRUE
@GO Classes i hope i am using the correct logic