Merge Code 1 1 Pre : arr [ first . mid] and arr [ mid + 1 . last ] are sorted 1 1 Post : arr [ first . last ] are sorted void merge ( int arr [ ] ,...

Homework help cs c language

how can the merge function be modified to achieve the description of the question

• Attachment 1
• Attachment 2
• Attachment 3

Merge Code1 1 Pre : arr [ first . . mid] and arr [ mid + 1 . . last ] are sorted1 1 Post : arr [ first .. last ] are sortedvoid merge ( int arr [ ] , int First , int mid , int last ) [int len = last - first + 1 ; int newArr [ 1en ] ;int left = first ; int right = mid + 1 ;For ( int newpos = O ; newPos < len ; newPos + + ) [if ( arr [ left ] < arr [ right ] ) [newArr [ new P os ] = arr [ left + + ] :` else [newArr [ new Pos ] = arr [ right + + INarr cpy ( arr + first , newArr , len ) ;post- increment operator . Equivalent code*newArr [ newPos ] = arr [ left ] ;left+ + ;`