The capacity of a cut is defined as the sum of capacities of nodes that composes the cut. O True False

True or false: Merge sort can be implemented using O(1) auxiliary space.

In this code: #include <iostream> #include <string> using namespace std;// Node struct to store data for each song in the playliststruct Node { string data; Node * next;};// Function to create a new node and return its addressNode * getNewNode(string song) { Node * newNode = new Node(); newNode -> data = song; newNode -> next = NULL; return newNode;}// Function to insert a new node at the head of the linked listvoid insertAtHead(Node ** head, string song) { Node * newNode = getNewNode(song); if ( * head == NULL) {  * head = newNode;  return;} newNode -> next = * head; * head = newNode;}// Function to insert a new node at the tail of the linked listvoid insertAtTail(Node ** head, string song) { Node * newNode = getNewNode(song); if ( * head == NULL) {  * head = newNode;  return; } Node * temp = * head; while (temp -> next != NULL) {  temp = temp -> next; } temp -> next = newNode;}// Function to remove a node from the linked listvoid removeNode(Node ** head,…

How to insert a new node in the Sorted Queue   subject : DSA