If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is? (A) N^2 (B) N (C) Nlog2N (D) log2Nâ–ºCorrect Option Correct Option is: D