insertion sort lower bound and why it compare to `1/(2^n)`?

Question

I have one question:

1. we know n!*(1/(2^n)) compared to 2^n, but what about insertion sort why it co