5. use the hamilton paths to rank the players in the tournaments again. explain what you did. in your
explanation, answer the following questions. did each graph contain a hamilton path? can there be more than
one hamilton path? how/when does a hamilton path produce a ranking? what do you do if there is more than
one hamilton path?
boys
girls
1"
6. another way to rank players is to use the matrices directly, without converting them to vertex-edge digraphs.
a. compute the row sums for each matrix. explain how (when) this information you rank the players.

i need plz