If it is known that the running time for algorithm A is O$($logn $)$and that the running

time for algorithm B is O$($n$^2),$ what does this statement imply about the relative

performance of the algorithms? Explain your answer.