As a computer store manager, you currently hold in your stock n different models of computers.

To organize your shop, you wish to sort the different models according to their memory capacity.

If two models have the same memory capacity, decide for yourself, which one comes first. A memory of a computer is composed of bits and is always a number of the form $2^$k for some natural number k$.$ Assume that the maximal capacity is at most $2^$n Suggest an efficient algorithm for sorting all the models and analyze its runtime in the worst case.