Let \(n\) be a positive integer. On each side of a square \(n\) points are chosen. (No point is at a vertex of the square.)
(a) How many segments are there whose endpoints are two of the above points and such that no segment lies along a side of the square?
(b) What is the maximal possible number of intersection points of the segment from part (a)?