3/3 pts Question 2 Suppose you have implemented an algorithm in a method named foo, which takes an array of N floating point numbers as data. Suppose also that this algorithm has O(N3) best, average, and worst case time complexity and that a timing analysis of foo showed that approximately 2 seconds were required to process an array of size N = 256. What is the largest array (N) that foo could process in less than one hour? A. 512 B. 1024 C. 2048 D. 4096 ct