Given a strictly increasing array arr of positive integers and a positive integer k, return the $k^{th}$ positive integer that is missing from arr.

Constraints:

• $1 \leq$ arr.length $\leq 10^3$

• $1 \leq$ arr[i] $\leq 10^3$ ...