# define a function

# name : QRrot

# input : A $(2$d numpy array, size nxm$)$

# output : Q $(2$d numpy array, size nxn$),$ R $(2$d numpy array, size nxm$)$

# note : A $=$ QR is the QR decomposition of A

# note : The function should work for any size rectangular array

# note : You may assume A is full rank and n$>$m

# note : Use rotators to compute the decomposition

# note : Use a conditional to check if a number is nearly zero before applying

# a rotator. Use a tolerance of $1$e$-15.$

def QRrot$($A$)$:

# add code here

return$($Q$,$R$)$