Aset of n labeled line segments situated along the x-axis. each line segment is initially represented by two records, one describing its left endpoint, as (x- value, label, l), and one describing its right endpoint, as (x-value, label, r). assume that the 2n points are initially given ordered by x-value and that no two points have the same x-value. output: the number of breaks (i. e., a single integer) between overlapping sequences of line segments in the range of the left endpoint of the first line segment to the right endpoint of the last line segment. discuss the asymptotic running time and cost of your algorithm on the following architectures
a) ram
b) mesh of size n