What is the best time complexity of bubble sort?

Your answer:

n$2$

n

n$($logn$)2$

nlogn