1) Write a method called matrix_to_list(li) that takes a matrix representation of a graph as an argument and returns a list representation of the same graph. 2) Write a method called list_to_dict(d) that takes a list representation of a graph as an argument and returns a dictionary representation of the same graph 3) Write a method called lo high(li) that takes an unsorted list of unique inte- gers as an argument and puts the smallest integer in li[0] and the largest integer in position li[len(li) - 1). You should modify li and not create a new list. The method shouldn't return anything. Do not sort the list. You should make only one pass over the list. Do not use nested loops. Code in Python