Question

When proving insertion-sort, the inner loop must be shifted all sorted elements bigger than the key by 1 place/location.
Give an appropriate loopinvariant for the inner loop and must prove that loop invariant is correct.