Help me in solving DSAAGP09 problem

help
,
1

My issue

provide the right code

My code

#include <stdio.h>

void merge_arrays(int array1[], int size1, int array2[], int size2, int merged_array[]) {
    // Step 1: Copy elements from the first array
    for (int i = 0; i < size1; i++) {
        merged_array[i] = array1[i];
    }

    // Step 2: Copy elements from the second array
    for (int j = 0; j < size2; j++) {
        merged_array[size1 + j] = array2[j];
    }
}

int main() {
    int array1[] = {1, 2, 3};
    int array2[] = {4, 5, 6};

    int size1 = sizeof(array1) / sizeof(array1[0]);
    int size2 = sizeof(array2) / sizeof(array2[0]);
    
    // Step 3: Create a new merged array
    int merged_array[size1 + size2];

    // Step 4: Merge the arrays
    merge_arrays(array1, size1, array2, size2, merged_array);

    // Print the merged array
    printf("Merged Array: ");
    for (int k = 0; k < size1 + size2; k++) {
        printf("%d ", merged_array[k]);
    }
    printf("\n");

    return 0;
}

Learning course: BCS301: Data structures
Problem Link: https://www.codechef.com/learn/course/abesit-dsa/ABESITDS05/problems/DSAAGP09