Given an array which contains both positive and negative integers in it and asked to design an algorithm to find the maximum sum which does not contain two consecutive numbers.What is the time comlexity of efficient algorithm
A) Θ(nlogn)
B) Θ(n)
C) Θ(n2)
D) Θ(n2logn)