6.) Assume that a graph G has no loops. Let v be a vertex of G and let E, be the set of edges that are incident with v. For each e e E. let c(e) be the number of cycles of G that contain e. Prove that if|E:
is odd. then an odd number of the numbers cle). for c E E. are even.​

the answer is 13 cm

answer: you will have more water.

we are given scale of 2 units.

on graph paper the space is 2.5 cm.

length of glass = 8 units.

8 units = 2 units +2 units +2 units +2 units.

each 2 unit is = 2.5cm.

therefore,

8 units = 2 units +2 units +2 units +2 units = 2.5+2.5+2.5+2.5= 10cm.