Mark all the statements that are true

The forward$-$backward algorithm and Tarjan's algorithm can find all the strongly connected components with one pass

We can detect whether a graph is bipartite using one pass of BFS traversal

Every strongly connificted graph should have at least one source and one sink

A bridgeless component will never have any articulation point