Given two integer array of size $$$n$$$, $$$m$$$, you need to merge these two arrays into one such that order of element in each array doesn't change and size of their Longest Increasing Subsequence become maximum.

we need to find maximum possible length of longest increasing subsequence. Assume $$$n, m < 100$$$.