Consider a sequence of three distinct values, that we denote S = [x0, x1, x2]. Using a decision tree, illustrate all the possible comparisons made by the selection-sort algorithm. Each comparison must be of the form xi