Analyzing an algorithm with Big O notation is useful for predicting A. the accuracy of the computation B. the performance of the algorithm as different amounts of inputs are processed C. the time required to write the required code D. both A and B