Let G be the undirected graph with node set {a,b,c,d,e,f,g,h) and edge set {(a, c), (b, c), (c, f), (d, e), (e. ? (f, g), (e, h)). If we choose node c, e, or f as the root, the resulting rooted tree has five leaves, but if we choose any other node as the root, the resulting rooted tree has four leaves. Select one: True O False