Problem 1: You are given a friendship (undirected connected) Facebook graph for a social network. Remove as many edges as possible such that the graph is still connected. The input is given in the form of a list of bidirectional edge pairs. Example: Input: [('A','B'),('A','C'),('B','C')] Output: [('A','B'),('A','C')] or [('A','B'),('B','C')] or…