-->
There exists a parallel algorithm to solve the maximum finding problem with $$T(n) = O(1) $$ and $$ W(n) = O( n^{8/7} )$$.答案:TRUE