1p 1. Implement the brute force algorithm for the Traveling Salesman Problem. The algorithm should check all the permutations of the vertices and return the minimum weight of a cycle visiting each vertex exactly once. 1 import networkx as nx from itertools import permutations 2 3 4 5 6 7 # This function takes as input a graph g. # The graph is complete (i.e., each pair of distinct vertices is connected by an edge), # undirected (i.e., the edge from u to v has the same weight as the edge from v to u), # and has no self-loops (i.e., there are no edges from i to i). # # The function should return the weight of a shortest Hamiltonian cycle. # (Don't forget to add up the last edge connecting the last vertex of the cycle with the fir. 00 0 10 # 11 12 # You can iterate through all permutations of the set {0, n-1} and find a cycle of the 13 14 15 16 def all_permutations(g): # n is the number of vertices. n = g. number_of_nodes) 17 18 19 20 # Iterate through all permutations of n vertices #for p in permutations (range(n)): # Write your code here. 21 22 23 return ??? Run 24