Imagine 2n points on a circle (so there are n-pairs of points). How many ways can you pair points with line segments without having any line segments that intersect? Express your function f(n), in terms of the number of pairs. Imagine 2n points on a circle (so there are n-pairs of points). How many ways can you pair points with line segments without having any line segments that intersect? Express your function f(n), in terms of the number of pairs