Write a program that will undertake a range search of all elements lying within limits a, b along a dimension i of the multidimensional data set, represented as a k-d tree. For example, given the data set {(7, 5), (4, 2), (6, 8), (1, 4), (3, 5), (2, 4), (3, 7), (9, 1), (6, 6), (5, 1)) represented as a k-d tree (k = 2), a range search of data elements lying within (a = 3, b = 7) along dimension i = 2 yields ((7, 5), (1, 4), (3, 5), (3,7),(6, 6)}.