Recall the discussion about the Maximum Finding Problem (that is

Recall the discussion about the Maximum Finding Problem (that is, to find the maximum among $$n$$ numbers in an array), Common CRCW memory strategy is used to assure $$T(n) = O(1)$$ for the parallel algorithm. Actually, we can also apply Arbitrary CRCW memory strategy to keep $$O(1)$$ time complexity. Now let us consider a new memory strategy, namely the **C**oncurrent **R**ead **O**wner **W**rite (CROW). It means that each memory has an official "owner". Only the "owner" can write to the corresponding memory. Then there is no parallel algorithm that can solve the problem with $$T(n) = O(1)$$ using CROW memory strategy. ~@[](2)

答案：TRUE