(python3)

Description You are given a predefined adjacency matrix in a 2D list format encoded in a pickle file. Write a program to delete the third vertex (index =2 ) and its relevant edges from the graph, return the total number of edges from this graph. Input (From File: input.pkl) A 2D list in a pickle file (input.pkl) Ex: [[0,1,1],[1,0,0],[0,1,0]] Output (To File: stdio.txt) Standard Output: An integer Ex: 2