How many vertices have an odd degree? question 1 options: 1 2 3 4 question 2 (1 point) if a graph has exactly 2 odd vertices, then question 2 options: an euler circuit exists no circuit exists at least one path exists no path exists question 3 (1 point) which path shows trace-ability? question 3 options: ea, ab, bc, cd, de ea, ab, bc, cd, de, ec, ca ac, cb, ba, ae, ed, dc bc, cd, de, ea, ab question 4 (1 point) saved in order to trace this graph without lifting your pen or retracing an edge you could begin at vertex question 4 options: a b c d question 5 (1 point) saved this graph has a/is question 5 options: euler circuit euler path not traceable euler circuit and euler path