Consider an array of integers of size . The indices of run from 1 to . An algorithm is to be designed to check whether satisfies the condition given below.
such that ,
Which one of the following gives the worst case time complexity of the fastest algorithm that can be designed for the problem?
- A
- B
- C
- D

