Everything being equal, how would run-times compare for an algorithm A with scaling = O(N) compared to an algorithm B with scaling = O(N ^ 2) when N = 10? (Note that "N ^ 2" means N squared)

a.)A is 10 times slower than B b.)A is 4 times faster than B c.)A is 10 times faster than B d.)Cannot determine this, as it depends on the algorithm details