Peter studies algorithm efficiency and compares two sorting methods. Method A runs in O(n²) time and takes 0.01n² seconds for n elements. Method B runs in O(n log n) time and takes 0.05n log₂(n) seconds. For what minimum value of n does Method B become faster than Method A? - Portal da Acústica