Solve the computer system scheduling problem of Example 2.17 if \(n = 3\) and the cost of converting from the \(i\)th configuration to the \(j\)th is given by \[\begin{bmatrix}- & 8 & 11\\12 & - & 4\\3 & 6 & - \end{bmatrix}\]

Order	Total cost
1 2 3	8 + 4 = 12
1 3 2	11 + 6 = 17
2 1 3	12 + 11 = 23
2 3 1	4 + 3 = 7
3 1 2	3 + 8 = 11
3 2 1	6 + 12 = 18

The lowest-cost ordering of 3 programs is \(2, 3, 1\)