The correctness of an algorithm can be fastly proved by checking certain conditions. The well-defined computational problem P is a triplet P(i, o, r).

a) True
b) False