Consider a polyhedron having 100 edges.(a) Find the maximal possible number of its edges which can be intersected by a plane (not containing any vertices of the polyhedron) if the polyhedron is convex.(b) Prove that for a non-convex polyhedron this number
i. can be as great as 96,
ii. cannot be as great as 100.(A Andjans, Riga combinatoricsgeometry3D geometrycombinatorial geometry