Python Code the equation by QR Decomposition$/$ Factorization, $$SVD$,$LU$,$Jacobi, Gauss Seidel, Finite Difference $6$ each method get the approximate solution of the boundary value problem with graphies, and compare the solutions with graphies to exact solution with graph to get which method is smallest error in it$.$t$=$t$"$; t$(1)=$square of root of $2$; t$(2)=($square of root of $2)/2$