Discrete math problemConstruct a directed network whose vertices represent the numbers:11,12,13,15,17and whose weights tell how much you must add to get from one vertex to another. Include only edges of positive weight.

Chess is a board game, where the board is made up of 64 squares arranged in an 8-by-8 grid. One of the pieces is a rook, which can move from its current square any number of spaces either vertically or horizontally (but not diagonally) in a single turn. Discuss how you could use graphs to show that a rook can get from its current square to any other square on the board in at most two turns. You’re encouraged to utilize relevant graph definitions, problems, and algorithms where appropriate.

a C c and d b and c b and d d and f e and f a and b c and f a and e 4 e Select all pairs of vertices which are adjacent in the graph.

Please explain discrete math problem, step by step