Please help me
#include <stdio.h> int g[10][10], vertex[10], visited[10]; void DFS(int i); int main() { int n; printf("Enter the number of vertices: "); scanf("%d", &n); printf("Enter the value of vertices: "); for (int i = 0; i < n; i++) { scanf("%d", &vertex[i]); } printf("Enter the adjacency matrix:\n"); for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { scanf("%d", &g[j][k]); } } // Initialize the visited array for (int i = 0; i < n; i++) { visited[i] = 0; } printf("DFS starting from vertex 0:\n"); DFS(0); return 0; } void DFS(int i) { printf(" %d", vertex[i]); visited[i] = 1; for (int j = 0; j < n; j++) { if (g[i][j] == 1 && !visited[j]) { DFS(j); } } }