Write the code for the merge method in data structure

This code is a part of a C dictionary. Please write the code for the below requirements.   dict_get   Next, you will implement: char* dict_get (const dict_t* dict, const char* key); This function goes through the list given by dict. If you use the above structure, this means starting at el = dict->head and checking each time whether the key at el is key; if it is not, we set el = el->next, until either key is found, or we reach el == NULL. To compare key with el->key, we need to compare one by one each character in key with those in el->key. Remember that strings in C are just pointers (memory addresses) to the first character in the string, so comparing el->key == key will not do what you want. So how do you even get the length of a string s? You would start at memory location s and advance as long as the byte at s (i.e. *s) is not the end-of-string marker (\0, the NULL character). This can get a bit messy, so luckily, you are allowed to use the string comparison…

In python don't import libraries

Write a function called list_to_dict(lst) that takes a 2-D list of sales records of this form.[["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75]]Your function will store the sales information in a dictionary, where each {key:value} pair of the dictionary stores {a unique customer: [ a list of all products purchased by this customer, total cost of these products]}, and returns the dictionary.   Sample run,sales = [ ["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75],["customer2", "milk", 4.35], ["customer3", "egg", 3.6], ["customer4", "bread", 4.5],["customer1", "milk", 4.35], ["customer2", "egg", 3.6], ["customer4", "milk", 4.35] ]>>> record = list_to_dict(sales)>>> display(record)customer1 : [['bread', 'egg', 'milk'], 16.1]customer2 : [['bread', 'milk', 'egg'], 12.45]customer3 : [['egg'], 3.6]customer4 : [['bread', 'milk'], 8.85]

Explain the concept of lazy loading and its application in optimizing data binding performance.

please answer

C PROGRAM BEING USED: In keeping the following code, how do I replace the Merge Sort code part(s) with the qsort() standard library function? The sorting function in the code should be utilizing the qsort() function and not the Merge Sort code. //include reuired headr files#include <stdio.h>//this header is used for srand() and rand() functions#include <stdlib.h>//this header file is used for time() function#include <time.h>//main() functionint main(){    //declare array and variables    int a[100], number, i, j, temp;     // Use current time as     // seed for random generator    srand(time(0));    //create random number between 0 to 99 and assign to array     for(i = 1; i <=100; i++)        a[i]=rand() % 99 + 1;    //print source array which is not sorted    printf("Source Array:\n");     for(i = 1; i <= 100; i++)  {        //assign array value to n        int n=a[i];        //declare count variable and initialise to 0        int count=0;        //this loop…

6. Which of the following is not a variant of merge sort? a) in-place merge sort b) bottom up merge sort c) top down merge sort d) linear merge sort