I need help with creating a function that take two dictionaries as the input. It will look at the starting indexes for both and create an array that's size is equal to both dictionaries combined. then it will place the contents of dictionary 1 and 2 onto this new array sorted. the dictionaries each contain a few strings of food as elements. dict 1 has "apple, banana, orange" and 2 has "car, truck, bus". I have created the dicts using structs as such
struct mystruct {
char key[20];
char content[20];
int count;
};
where each element in the dict has a key and a content value. we also have a count but i dont know if we need it. Ive tried a few things but most of them not only give error, but have fault in the logic, aka i didnt know where i was going with it.