Complete the Python function below which returns a list of stacks that a given tyre could be in$.$ The list should be ordered so that the stack with the smallest suitable top tyre is first and the stack with the largest suitable top tyre is last. If it is not possible for the tyre to be in a stack, then that stack should not be included. You should use at least one appropriate divide and conquer technique in answering this question. You should implement your own sorting technique rather than using any existing Python methods.