Question $2-$ Write a function that takes incidence matrix representation of a graph G$,$ which may not be a simple, and returns the corresponding simple graph which is obtained by removing loops and extra parallel edges from it$.$

Example:

Input:

$\backslash$table$[[,1,2,3,4,5,6,7,8,9,10],[1,1,0,0,0,1,0,0,1,0,1],[2,1,1,1,0,0,0,0,0,1,0],[3,0,0,1,1,0,0,0,0,0,0],[4,0,0,0,1,1,1,0,0,1,0],[5,0,0,0,0,0,1,1,1,0,1],[6,0,0,0,0,0,0,0,0,0,0]]$

Output:

$\backslash$table$[[,1,3,4,5,6,8,9],[1,1,0,0,1,0,1,0],[2,1,1,0,0,0,0,1],[3,0,1,1,0,0,0,0],[4,0,0,1,1,1,0,1],[5,0,0,0,0,1,1,0],[6,0,0,0,0,0,0,0]]$