Mr$.$ Elf owns a show store. Currently, he has $10$ pairs of shoes that require resoling and polishing. He has a machine that can resole one pair of shoes at a time, and the time required for the operation varies with the type and condition of the shoe and the type of sole that is used. Shoes are polished on a machine dedicated to this purpose as well, and polishing is always done after resoling. His assistant generally does the polishing while Mr$.$ Elf does the resoling. The resoling and polishing times $($in minutes$)$ are:

Shoes Resoling Time Polishing Time

$1143$

$2281$

$3122$

$465$

$51010$

$6146$

$7412$

$8258$

$9155$

$10105$

Determine the sequence in which these shoes should be repaired to minimize the total makespan for these $10$ jobs, and answer the following questions.

Based on the optimal sequence: $($Enter integer only$)$

The first job to be processed is Job

$.$

The third job to be processed is Job

$.$

The fourth job to be processed is Job

$.$

The fifth job to be processed is Job

$.$

The seventh job to be processed is Job

$.$

The ninth job to be processed is Job

$.$

The last job to be processed is Job

$.$