notes figure (alists before concatenation and (blist after concatenation null null (atemp null (bthe function to achieve this is given belowconcatenate (struct node *pstruct node *qstruct node *temptemp pif ( =null)/if first list is null then concatenated /list will be only second list and will be else //pointed by ptemp pwhile (temp -link nulltemp temp -linktemp -link summary the foremost advantage of linked lists in dynamic storage is flexibility advantages overflow is no problem until the computer memory is actually exhausted especially when the individual entries are quite largeit may be difficult to determine the overflow amount of contiguous static storage that might be needed for the required arrays while keeping enough free for other needs with dynamic allocationthere is no need to attempt to make such decisions in advance changesespecially insertions and deletionscan be made in the middle of changes linked list more quickly than in the middle of contiguous list if the structures are largethen it is much quicker to change the values of few pointers than to copy the structures themselves from one location to another disadvantages the first drawback of linked lists is that the links themselves take space that might otherwise be needed for additional data in most systemsa pointer requires the same amount of storage (one wordas does an integer thus list of integers will require double the space in linked storage that it would require in contiguous storage lovely professional university