13.5 In the text it was shown that clock synchronization is impossible for three processors, one of which can be Byzantine. Extend this result to show that n must be larger than 3f, for any value of f (not just f = 1). Hint: Do not try to modify the previous proof. Instead use a reduction, as in the proof of Theorem 5.8.