1. (30 pts) You are given 2 non-empty sorted lists with no duplicates. Answer the following...

Transcribed Image Text:

1. (30 pts) You are given 2 non-empty sorted lists with no duplicates. Answer the following questions: (a) (10 pts) Print the list of their intersection. If no intersection is found print "NULL". (b) (10 pts) Write a function GetPreviousItem(ItemType& item), that allows you to fetch the previous item in a sorted list. You can make other changes if necessary. (c) (10 pts) Print the reverse merged list. Sample Input: A=[1,3,5,7] and B= [2,3,4,7] Sample Output: C= [3,7] and C(reverse)= [7,3] 1. (30 pts) You are given 2 non-empty sorted lists with no duplicates. Answer the following questions: (a) (10 pts) Print the list of their intersection. If no intersection is found print "NULL". (b) (10 pts) Write a function GetPreviousItem(ItemType& item), that allows you to fetch the previous item in a sorted list. You can make other changes if necessary. (c) (10 pts) Print the reverse merged list. Sample Input: A=[1,3,5,7] and B= [2,3,4,7] Sample Output: C= [3,7] and C(reverse)= [7,3]

Answer rating: 100% (QA)

a include using namespace std void interse... View the full answer