I won't show you what it looks like, but I will show you how to get it.

Start by writing the elements across the way and down, as you probably have in your notes,

Then, go to the top element in the column, it's the , and go across right-multiplying by every element in the top row. Then go to the second top element in the column, , and right multiply this by every element in the top row, so your top two rows will look like,

Then repeat with all the other rows until the table is completely filled. You will notice that it is filled mostly with `words' outwith the given set (for example, and are not in the set). So your next stage is to apply the relations you are give which the generators satisfy. That is, re-write your table looking at each word in turn and using these relations to turn the element into an element from your set.

So, for example, .

You should end up with a table containing only elements from the given set, and which is NOT symmetric along the diagonal. Also, every element should appear precisely once in every row and column (think suduko).