We first adapt the proof of [8, Theorem 3.3] and show a lower bound of 2 on the approximation ratio of any deterministic truthful mechanism. We highlight that this lower bound does not make any assumptions on the computational power of the mechanism…