Graph Challenge

Problem Statement

Graph Challenge Problem Description Have the function GraphChallenge(strArr) read strArr which will be an array of hyphenated letters representing paths from the first node to the second node. For example: ["a->d", "e->f"] means that there is a path from node a to d, e to f, and so on. The graph will be bipartite meaning that it is possible to separate the nodes into two disjoint sets such that every edge only connects a node from the lefthand side to a node on the righthand side. Your program should determine the maximum cardinality matching of the bipartite graph, which means finding the largest possible number of non-adjacent edges that are matching. So for the example above, your program should return 3 because it is possible to connect every single node on the left to a node on the right. The input will only contain lowercase alphabetic characters with a " -> " between them signifying an edge between them going from the left node to the right node. The input will contain at least