The authors solve a maximal monotone inclusion problem by the proximal point algorithm. The problem is to find \(w^*\) such that \(0 \in T(w^*)\), where \(T: \mathbb R^n \rightarrow \mathbb R^n\) is a maximum monotone operator. It can be shown that \( 0 \in T(w^*)\) i.e. \( w^* \in T^{-1}(0)\) if and only if \(w^*\) is the fixed point of the resolvent operator \((I + \lambda T)^{-1}\), where \(\lambda > 0\). The authors consider the following iteration scheme: \[ w^{k+1} = (I + \lambda T)^{-1}(w^k),~ k = 0,1,2, \dots, \] where \(w^0\) is any element of \(\mathbb R^n\). The sequence \(\{ w^k \}\) converges to the fixed point of the operator \((I + \lambda T)^{-1}\). The main result of the paper is etablishing the worst case sublinear convergence rate of the sequence and the proof that the the established convegence rate is tight.