Given an array `nums`

and a subsequence `sub`

, find the shortest subarray of `nums`

that contains `sub`

.

Example: `nums = [1,2,3,5,8,7,6,9,5,7,3,0,5,2,3,4,4,7], sub = [5,7]`

Answer: `start = 8, size = 2`

If such subarray does not exist, return `-1, -1`

.

Note that the subarray must contain the elements of `sub`

in the correct order..