input: Write a function to optimize a Python program that processes a 2d array and stores the transpose output in a new array.
  
  def optimize_transpose(A):
   n = len(A)
   m = len(A[0])
  
   B = [[0 for x in range(n)] for x in range(m)]
  
   for i in range(n):
    for j in range(m):
     B[j][i] = A[i][j]
  
   return B
  
  assert optimize_transpose([[1,2],[3,4]])==[[1,3],[2,4]]
  assert optimize_transpose([[1,2,3],[4,5,6]])==[[1,4],[2,5],[3,6]]
  assert optimize_transpose([[5,6,7],[8,9,10],[11,12,13]])==[[5,8,11],[6,9,12],[7,10,13]]
  assert optimize_transpose([[1,2],[3,4],[5,6],[7,8]])==[[1,3,5,7],[2,4,6,8]]
  assert optimize_transpose([[1]])==[[1]]
output: def optimize_transpose(A):
      return [[A[i][j] for i in range(len(A))] for j in range(len(A[0]))]