Create a program that given 2 sorted lists (A and B, using ArrayList) return:
- A list with all numbers in the 2 lists without duplicated numbers (C = A U B)
- A list with all numbers, including duplicated numbers (C = A + B)
- A list with all numbers that are in both lists (C = A intersection B)
- A list with all numbers of A that don't exist in B (C = A - B)
- A list with all numbers in A and in B that don't exist in both lists (C = (A U B) - (A intersection B)