Meeting for what? And what is it on?
I'm going have to go with with 1.b and 2.d hope this helps and I don't need help right now.
Explanation:
The statement which says that a graph is complete means an undirected graph whose every pair of vertices is connected by an particular edge or unique edge.
An undirected graph is a graph whose edges soea not contain any direction means to which vertex they are directed.
A complete graph has an edge between every pair of vertices that exist in that graph.
Answer:
Assuming this is a true or false question, it's false.
Explanation: