Merge Three or N Sorted Lists Efficiently and Analyze Complexity

Problem Write a method that combines three lists already sorted in ascending order into one sorted list. Each value from the inputs should appear once in the result. Signature Constraints The inputs are three lists of integers. Each input list is sorted in ascending order. The returned list must be sorted in ascending order and contain no duplicate values. Examples Example 1 The values are collected from all three sorted lists, arranged in order, and repeated values would be…