Assume last digit: 2

You have to Write full Program code using C language

Write a program to construct a simple graph. Every vertex of the graph can connected with a maximum N number of neighbors. User will input the number of vertices. And the value of N will be 2 + (Last digit of your id % 5) You have to construct the graph using dynamic memory allocation. Finally, Implement BFS and DFS for a given vertex on your constructed graph