Consider a convex n-gon such that no 3 diagonals intersect at a single point. Draw all the diagonals (i.e. connect every pair of vertices by a segment).

a) How many intersections do the diagonals determine?

b) Into how many parts is the polygon divided by the diagonals?