<｜begin▁of▁sentence｜>### Instruction:
Given an Erdős-Rényi graph with 100 nodes and a connection probability of 0.05, can you use the is_bipartite method to decide if this graph is bipartite? Also, if it is bipartite, how can you find and print the group assignments of the vertices?
### Response:
import igraph as ig

g = ig.Graph.Erdos_Renyi(n=100, p=0.05)
bipartite, vertex_types = g.is_bipartite(return_types=True)
print('The graph is bipartite:', bipartite)
if bipartite:
    print('Vertices in group A:', [v.index for v in g.vs if vertex_types[v.index]])
    print('Vertices in group B:', [v.index for v in g.vs if not vertex_types[v.index]])
<|EOT|>
