14. (6 pts) From our Class, we said the Konigsberg bridge problem does not contain a Euler Circuit nor a Euler Path. Explain with drawing. How are we able to immediately tell if a graph has a Euler path or circuit? Explain the difference between Euler path and circuit and give a diagram example of each. 15. (4 pts) Explain why we know that the smaller the base value is, the greater number of characters it will take to represent the same value. Explain in general and then give specific example. ge 8 of 10