Suppose a network is modeled as a 3-regular graph $G$ with $n=14$ vertices. If the graph is bipartite, what is the maximum possible size of the largest independent set?