$(3)$ Given a graph $G(N,E)$ stored using an adjacency list, what is the time complexity $O()$ of traversing the graph structure? $($No explanations are needed$)[1$ mark$]$