Please help me these exercises of DISCRETE MATHEMATICS . Thanks a lot !!

1 PROBLEM Given the list of edges of a simple graph, determine whether the graph is bipartite. 2 PROBLEM 2 Given an adjacency matrix of a graph, list the edges of this graph and give the number of times each edge appears. 3 PROBLEM 3 Given an incidence matrix of an undirected graph, list its edges and give the number of times each edge appears 4 PROBLEM 4 Given the list of edges and weights of these edges of a weighted connected simple graph and two vertices in this graph, find the length of a shortest path between them using Dijkstra algorithm. Also, find a shortest path 5 PROBLEM 5 Given the list of edges of a simple graph, determine whether it is connected and find the number of connected components if it is not connected. 1 PROBLEM Given the list of edges of a simple graph, determine whether the graph is bipartite. 2 PROBLEM 2 Given an adjacency matrix of a graph, list the edges of this graph and give the number of times each edge appears. 3 PROBLEM 3 Given an incidence matrix of an undirected graph, list its edges and give the number of times each edge appears 4 PROBLEM 4 Given the list of edges and weights of these edges of a weighted connected simple graph and two vertices in this graph, find the length of a shortest path between them using Dijkstra algorithm. Also, find a shortest path 5 PROBLEM 5 Given the list of edges of a simple graph, determine whether it is connected and find the number of connected components if it is not connected