Write a C program to compute the max interleave factor i for an integer sequencr x that X^i is a subsequence of A.

Size of Array A >= Size of Array X

- Two set of Integer (i.e. A and X), one per line with -999999999 in between numbers in A and X array (must use malloc)

-Input must not use file read (no file.in/file.out- must use scanf)

If X = abbcda, X ^2 (i=2) = aabbbbccddaa and X^3 = aaabbbbbbcccdddaaa. (X^0 is always an empty case)

(Use Binary Search and Check if X^(i) is subset of A)

The output of is the trace of the successes and failures of a binary search (including low, mid, and high) for determining the maximum interleave factor that satisfies the subsequence condition. The last line output should provide the maximum interleave factor