<prompt> Kwa kuzingatia n x n chembe mbili za jozi mat na lengwa, rudisha kweli _kama inawezekana kutengeneza_ mat _sawa na_ lengo _kwa kuzungusha_ mat _katika nyongeza za digrii 90 , au_ sivyo _vinginevyo._Mfano wa 1:Ingizo: mkeka 0,1,1,0, lengwa 1,0,0,1Pato: kweliMaelezo: Tunaweza kuzungusha mkeka nyuzi 90 kisaa ili kufanya mkeka ulengwa sawa.Mfano wa 2:Ingizo: mkeka 0,1,1,1, lengwa 1,0,0,1Pato: si kweliMaelezo: Haiwezekani kufanya mkeka kuwa sawa na lengo kwa kuzungusha mkeka.Mfano wa 3:Ingizo: mkeka 0,0,0,0,1,0,1,1,1, lengo 1, 1,1,0,1,0,0,0,0Pato: kweliMaelezo: Tunaweza kuzungusha mkeka nyuzi 90 kisaa mara mbili ili kufanya mkeka kuwa sawa.Vikwazo: n mat.length target.length n mati.length targeti.length 1 n 10 matij na lengwaij ama ni 0 au 1.  <response>: kuagiza rundodef minimumSizeidadi, maxOperations: pq -num for num in nums Nambari hasi kuiga lundo la juu heapq.heapifypq wakati maxOperations 0: maxBalls -heapq.heappoppq heapq.heappushpq, -maxMipira 2 heapq.heappushpq, -maxMipira - mipira max 2 maxOperations - 1 return -pq0 