)5. Show code for the function countSources which is passed an acyclic graph represen ted as a double adjacency list and returns a count of the number of source vertices. For the example graph below, countSources would return 2. This provides a list of predecessors and a list of successors typedef struct EdgeNode 8 14 int iVertex; int iWeight; struct EdgeNode *pNextEdge; 10 EdgeNode; typedef struct Vertex 5 szLabel [LABEL SIZE+1]; bVisited; char int EdgeNode
OR
OR