Compute the number of FLOPS in the above Python code

def PLU(A) ok1 small le-12 n = scipy . shape (A) [0] U-copy.copy (A) L = scipy. identity(n) p scipy. identity(n) for j in range (1,n): # set to if we encoun # pivots smaller than t # initialize L, U and p # loop over columns the s -scipy.argma x ( abs(ulj-1:n,J-1])) if s !- j-1: + j -1 # find largest num # if the largest number Uswap(U,s,j-1,n) Pswap(P,s,j-1,n) if j>l: L swap ( L , s ,j-1,J-1) = for i in range(j+1,n+l): # check for zero pivot if abs (U[j-1,j-1])small: print("Near-zero pivot!") reak L[i-1,j-1-Uli-1,j-1]/u[j-1,j-1] if(1*) +1):# Gauss elimination for k in range(j,n+1): return L,U,P,ok def swap (M,i,j,k)l # swap rows i and j from column dum = copy . copy (M[i,0:k]) MIi.ck] copy .copy (M [j.ck]) MIj.ck] copy . copy ( dum) return M up to (not including) k def PLU(A) ok1 small le-12 n = scipy . shape (A) [0] U-copy.copy (A) L = scipy. identity(n) p scipy. identity(n) for j in range (1,n): # set to if we encoun # pivots smaller than t # initialize L, U and p # loop over columns the s -scipy.argma x ( abs(ulj-1:n,J-1])) if s !- j-1: + j -1 # find largest num # if the largest number Uswap(U,s,j-1,n) Pswap(P,s,j-1,n) if j>l: L swap ( L , s ,j-1,J-1) = for i in range(j+1,n+l): # check for zero pivot if abs (U[j-1,j-1])small: print("Near-zero pivot!") reak L[i-1,j-1-Uli-1,j-1]/u[j-1,j-1] if(1*) +1):# Gauss elimination for k in range(j,n+1): return L,U,P,ok def swap (M,i,j,k)l # swap rows i and j from column dum = copy . copy (M[i,0:k]) MIi.ck] copy .copy (M [j.ck]) MIj.ck] copy . copy ( dum) return M up to (not including) k