Question: Define the method peek for the sorted list implementation of the ADT priority queue. Hint: We have already discussed insert and remove methods implementation in this module. c++ language

LinkedList merge( LinkedList l1 , LinkedList l2 )

{

// create a new Linked List

LinkedList ans = new LinkedList();

// get the length of list 1

int len1 = l1.getLength();

// get the length of list 2

int len2 = l2.getLength();

// store the index of current element in list 1

int i = 0;

// store the index of current element in list 2

int j = 0;

while( i <= len1 && j <= len2 )

{

// if the current node of list 1 is smaller than current node of list 2

if( l1.getEntry(i) <= l2.getEntry(j) )

{

// add the current element of list 1

ans.insertSorted( l1.getEntry(i) );

i++;

}

else

{

// add the current element of list 2

ans.insertSorted( l2.getEntry(j) );

j++;

}

}

// add the remaining elements of list 1 to ans

for( ; i <= len1 ; i++ )

// add the current element of list 1

ans.insertSorted( l1.getEntry(i) );

// add the remaining elements of list 2 to ans

for( ; j <= len2 ; j++ )

// add the current element of list 2

ans.insertSorted( l2.getEntry(j) );

return ans;

}