Is Graph Bipartite?

There is an undirected graph with `n` nodes, where each node is numbered between `0` and `n - 1`. You are given a 2D array `graph`, where `graph[u]` is an array of nodes that node `u` is adjacent to. A graph is bipartite if the nodes can be partitioned into two independent sets `A` and `B` such that every edge in the graph connects a node in set `A` and a node in set `B`. Return `true` if and only if it is bipartite. ### Constraints - `graph.length == n` - `1 <= n <= 100` - `0 <= graph[u].length < n` - `0 <= graph[u][i] <= n - 1` - `graph[u]` does not contain `u`. - All the values of `graph[u]` are unique. - The graph may be disconnected. ### Input Format - Line 1: An integer `n`. - Next `n` lines: Space-separated neighbors of node `i` (empty line if node has no neighbors). ### Output Format Print `true` or `false`.