Nextflix has two algorithms for displaying a detailed report and analysis of all the movies in its databases. Algorithm A always runs in 3 months. Algorithm B runs in O(logn) milliseconds where n is the number of movies. There is great debate amongst the Engineers in the dining area about which algorithm Netflix should use. Using Big O analysis, which algorithm is faster? Algorithm A Algorithm B O Neither A nor B