Please explain step by step, and explain how the weights can vary in each graph that follows the rules. Thank you.

1 Post ONE weighted simple graph, each following these rules: There are 10 vertices labeled v0 through vo The graph is connected There is a vertex of degree at least 3 Each edge is given a positive integer weight. At least 4 different weights are used. At most 8 different weights are used To get from v0 to v9 a path must use at least 4 edges