Write a function merge(lst1, lst2) that takes two sorted lists as arguments, and returns the elements of both lists, merged. This function must have a complexity of O(n + m) where n list the length of lst1 and m is the length of lst2. Input as two sorted lists lst1, lst2 like 1,merge([1, 2, 4, 6], [3, 5, 7, 8]) 2,merge([1, 2, 3], [4, 5, 6])
output:One sorted list 'res' merged together 1,[1, 2, 3, 4, 5, 6, 7, 8] 2,[1, 2, 3, 4, 5, 6]

7. the cullerton park district holds a mini-olympics each summer. create a class named participant with fields for a name, age, and street address. include a constructor that assigns parameter values to each field and a tostring() method that returns a string containing all the values. also include an equals() method that determines two participants are equal if they have the same values in all three fields. create an application with two arrays of at least eight participants each—one holds participants in the mini-marathon, and the other holds participants in the diving competition. prompt the user for participant values. after the data values are entered, display values for participants who are in both events. save the files as participant.java and twoeventparticipants.java.