<prompt> Kuandika DFS katika C kutumia std:: vector.  <response>: Heres an example of a Depth-First Search DFS algorithm implemented in C using std::vector:include include include using namespace std; Function to perform DFS traversalvector dfsvector graph, int start vector visitedgraph.size, false; keep track of visited nodes vector result; vertices visited in DFS order stack st; stack for DFS traversal st.pushstart; while!st.empty int vertex st.top; st.pop; if!visitedvertex visitedvertex true; result.push_backvertex; push adjacent vertices to the top of the stack forint igraphvertex.size-1; i0; i-- if!visitedgraphvertexi st.pushgraphvertexi; return result;int main Example graph vector graph 1,2,0,2,3,0,1,3,1,2; vector result dfsgraph, 0; Output the vertices visited in DFS order forint i0; i 