Using list xs :: [Int], prove the definition does not satisfy the law

Use the STL stack template class to develop a custom queue class (named cnPtrQueue).       ○ The cnPtrQueue has member variable numItems (that keeps track of the number of items in the queue), which should be helpful for implementing the member function size() (for inspecting the number of items in the queue).    ● Use the cnPtrQueue to perform a breadth-first (level) traversal of a linked list of linked lists data structure and process (print) the data items stored in the structure. Fill in the "holes" intentionally left:     ► Function body of ShowAll_BF in nodes_LLoLL.cpp.       ○ You are to put the cnPtrQueue (NOT the STL queue) to use here.

Implement the Linked List using head and tail pointer. Interface (.h file) of LinkedList class is given below. Your task is to provide implementation (.cpp file) for LinkedList class. Interface: template<class Type> class LinkedList { private: Node<Type>* head;               Node<Type>* tail; <Type> data; public:                 LinkedList<Type>(); LinkedList<Type>(const LinkedList<Type> &obj); void sortedInsert(Type); Type deleteFromPosition(int position); //deletes the node at the particular position Type delete(int start,int end); //deletes the nodes from starting to ending position bool isEmpty()const; void print()const; ~LinkedList(); };   program in c++.

Define collapse which reduces a list of MkType a b to two lists of type a and b respectively. You should respect the orignal ordering of the list .   collapse::MkType a b -> ([a],[b]) collapse = undefined   answer in haskell form.