In Python write out the Python Code for the following in Jupiter Lab. Show code and outputs. Use a data set and build 3 different pivot tables that each have a least a different index row or column. (You cannot build 2 pivot tables that have the same index rows and columns but aggregate differently. You also cannot simply flip the index rows and columns.) For each pivot table, build a graph.

Write a python program that simulates the throwing of two dices for 200 times while using a list to keep track of the statistics of the total face values between 2 and 12. Print the list out and also according to this list, print the following chart to visualize the simulation:Sample Run*:[4, 11, 20, 18, 27, 36, 25, 18, 15, 22, 4]2|****43|***********114|********************205|******************186|***************************277|************************************368|*************************259|******************1810|***************1511|**********************2212|****4*Note: I import the random module and set random seed to 37 for generating the random integers.

Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should be 3. If there are even nodes, then there would be two middle nodes, we need to print the second middle element. For example, if given linked list is 1 >2->3->4->5->6 then the output should be 4. Make the following adjustments to the class HWLinkedList  code below Add the method addAtHead to the class below. The method should simply add a new element to the beginning of the linked list instead of the end. Add the method searchList to the class below. The method should return true if the user specified object is found and false otherwise. The method must be recursive. Add the remove method   public class HWLinkedList<E> { private class Node<E> { private E data; Node<E> next; public Node(E data) { this.data = data; this.next = null; } } private Node<E> head; public HWLinkedList() { this.head…