Graph of Selection Sort

[silentB4dawn]

Hey everyone!
I'm trying to do my hw for class and I'm not really sure what kind of algorithm to use to accomplish what the problem's asking. It's kind of confusing wording, so maybe I'm not all that sure what it's asking. Here's the problem:

Design and implement an applet that displays a graph of the processing of an insertion sort.  
Use bars to represent the values being sorted.  Display the set of bars after each swap.  Put a 
delay in the processing of the sort to give the user a chance to see how the order of the values 
changes.

I'm not sure what exactly a "graph of the processing of a selection sort" would look like, and the bar representation confuses me too. Could anyone please help me with where I should start or what kind of algorithm to use? That'd be greatly appreciated
Thanks everyone!