[Problem 3] Consider the list of values L = [4,2,0,7,6,1,8,5,3] and the following image where we have paired indices of list L with the values of L at those indices. In addition, assume a straight...

Extracted text: [Problem 3] Consider the list of values L = [4,2,0,7,6,1,8,5,3] and the following image where we have paired indices of list L with the values of L at those indices. In addition, assume a straight line segment connecting each value on the left side with its equal value on the right side, ie. we link 0 with 0, 1 with 1, 2 with 2,.., and 8 with 8 using a straight line. 0 1 2 3 4 5 6 7 8 4 207 6 1 8 5 3 Using the modified version of the merge sort only, count the number of line segment crossing which occurs in this configuration. You cannot use drawing to solve this problem.