In python, solve in as few lines as possibleProblem $7.$ Sort $x$ so that the entries of the first column of $x$ are in an increasing order.

In $[]$: $x=$ np$.$ random. randn $(5,5)$

# Write your code below

Problem $8.$ Find the row vector in $x$ that is closest to the first row vector $($but not the first row itself$).$

In $[]$: $x=$ np$.$ random. rand $(10,2)$

#$pr{\displaystyle \underset{\phantom{}}{\overset{\phantom{}}{}}}(x)$

Problem $9.$ Swap the first two rows in $x.$

In $[]$: $x=$ np$.$ random. rand $(5,5)$

# Write your code here

Problem $10.$ Extract all the $33$ blocks from $x.$

In $[]$: $x=$ np$.$ random. rand $(10,10)$

# Write your code below

Problem $11.$ Generate the following array:

In $[]$: # Write your code here