Problem $2.[45$ points$]$A singly linked list is a type of linked list that is unidirectional, that is$,$ it can be traversed in only one direction from head $($first node$)$ to the tail $($last node$).$ Each element in a linked list is called a node. A single node contains data and a pointer to the next node which helps in maintaining the structure of the list.Write a C program to implement outer product of integer vectors stored separately in singly linked lists $($see the sample runs$).($a$)[8$ Points$]$ Write a C function to store integer digits into a singly linked list in order and return the list as an output, i$.$e$.,$ head of list will contain the most$-$significant digit.$($b$)[7$ Points$]$ Write a C function to display the node elements of a given singly linked list $($See the sample runs below$).($c$)20$ Points$]$ Write a C function that computes the outer product of two vectors stored in singly linked lists and returns the result as a $2$D array.Remark: In linear algebra, the outer product of two vectors is the matrix whose entries are all products of an element in the first vector with an element in the second vector. Given two vectors of size m x $1$ and n x $1$ respectively,