Which of the following statement(s) is/are false? (a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree. (b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree. (c) A complete graph (Kn) has a Hamilton Circuit whenever n≥3 (d) A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite. Codes: (A) (a) only (B) (b) and (c) (C) (c) only (D) (d) only