Would you please write the code in C or C++

Problem 2 (40 pts): Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: . The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. Example: Input: nums1 [1, 2, 3, 6,91, m-5 nums2 [2, 5, 6, 11, 21,66], n-6 Output: [1, 2, 2,3,5,6,6,9,11,21,66]