Intersection of Multiple Arrays

This lab aims to help you understand and implement a function to find the intersection of multiple arrays. You will be given a 2D integer array nums where nums[i] is a non-empty array of distinct positive integers. Your task is to return a list of integers that are present in each array of nums sorted in ascending order.

For a more in-depth understanding, let's walk through a few examples:

Example 1:

Input: nums = [[3,1,2,4,5],[1,2,3,4],[3,4,5,6]]
Output: [3,4]
Explanation: The only integers present in each of nums[0] = [3,1,2,4,5], nums[1] = [1,2,3,4], and nums[2] = [3,4,5,6] are 3 and 4, so we return [3,4].

Example 2:

Input: nums = [[1,2,3],[4,5,6]]
Output: []
Explanation: There does not exist any integer present both in nums[0] and nums[1], so we return an empty list [].

Keep the following constraints in mind when implementing your solution:

• 1 <= nums.length <= 1000
• 1 <= sum(nums[i].length) <= 1000
• 1 <= nums[i][j] <= 1000
• All the values of nums[i] are unique.

Get ready to exercise your coding skills! Create a function that efficiently calculates the intersections of given arrays and meets the specified requirements. Good luck!

Make sure that function is exported using the default keyword