Question

Consider two sorted integer arrays A and B in ascending order. We want two merge the two arrays to form a separate sorted array without violating the ascending order of the values.
(1) Implement the solution in C++ using primitive data types.
(2) What is the time complexity of populating the emerging array?

Answer 1

Answer:

89

Explanation:

89 is yr answere mate

Answer 2

Answer:

90

Explanation:

90 is ur answer mate ..............