I am getting $2$ errors on my test that I can't solve, I need help fixing lab$10.$py so it can pass TestLab$10.$py$.$ I put my code, test, and error message below:

lab$10.$py

class Entry:

def $\_\_$init$\_\_($self$,$ item, priority$)$:

self.item $=$ item

self.priority $=$ priority

def $\_\_$lt$\_\_($self$,$ other$)$:

return self.priority $$ other.priority

def $\_\_$eq$\_\_($self$,$ other$)$:

return self.priority $==$ other.priority and self.item $==$ other.item

class PQ$\_$UL:

def $\_\_$init$\_\_($self$)$:

self.queue $=[]$

self.len $=0$

def insert$($self$,$ item, priority$)$:

entry $=$ Entry$($item$,$ priority$)$

self.len $+=1$

self.queue.append$($entry$)$

def find$\_$min$($self$)$:

if not self.queue:

return None

return min$($self$.$queue$)$

def remove$\_$min$($self$)$:

if not self.queue:

return None

min$\_$entry $=$ min$($self$.$queue$)$

self.len $-=1$

self.queue.remove$($min$\_$entry$)$

return min$\_$entry

def $\_\_$len$\_\_($self$)$:

return self.len

class PQ$\_$OL:

def $\_\_$init$\_\_($self$)$:

self.queue $=[]$

self.len $=0$

def insert$($self$,$ item, priority$)$:

entry $=$ Entry$($item$,$ priority$)$

self.len $+=1$

self.queue.append$($entry$)$

self.queue.sort$()$

def find$\_$min$($self$)$:

if not self.queue:

return None

min$\_$entry $=$ self.queue$[0]$

return min$\_$entry.item

def remove$\_$min$($self$)$:

if not self.queue:

return None

min$\_$entry $=$ self.queue.pop$(0)$

self.len $-=1$

return min$\_$entry.item

def $\_\_$len$\_\_($self$)$:

return self.len

TestLab$10.$py

import random

import unittest

from lab$10$ import PQ$\_$OL$,$ PQ$\_$UL$,$ Entry

random.seed$(658)$ # Fix the seed so it fails the same way every time if there is a bug

class TestEntry$($unittest$.$TestCase$)$:

def setUp$($self$)$:

$""""""$

self.e$1=$ Entry$("$rachel$",0)$

self.e$2=$ Entry$("$jake$",1)$

self.e$3=$ Entry$("$marco$",2)$

self.e$4=$ Entry$("$cassie$",3)$

self.e$5=$ Entry$("$tobias$",4)$

self.e$6=$ Entry$("$ax$",5)$

def test$\_$init$($self$)$:

$"""$Tests that initialization is called correctly"""

self.assertEqual$($self$.$e$1.$item, 'rachel'$)$

self.assertEqual$($self$.$e$1.$priority, $0)$

def test$\_$lt$($self$)$:

$"""$Tests less than operator"""

for e in $[$self$.$e$2,$ self.e$3,$ self.e$4,$ self.e$5,$ self.e$6]$:

self.assertLess$($self$.$e$1,$ e$)$

for e in $[$self$.$e$1,$ self.e$2,$ self.e$3,$ self.e$4,$ self.e$5]$:

self.assertGreater$($self$.$e$6,$ e$)$

self.assertFalse$($self$.$e$1$ Entry$("$alice$",0))$

def test$\_$eq$($self$)$:

$"""$Tests equality operator"""

self.assertEqual$($self$.$e$1,$ Entry$("$rachel$",0))$ # same item & priority

self.assertNotEqual$($self$.$e$1,$ Entry$("$rachel$",1))$ # same item, different priority

self.assertNotEqual$($self$.$e$1,$ Entry$("$jake$",0))$ # same item, different priority

class TestPQ$\_$UL$($unittest$.$TestCase$)$:

def test$\_$add$\_$remove$\_$sequential$($self$)$:

$"""$Adds and removes items sequentially"""

# Construct PQ

n $=100$

pq $=$ PQ$\_$UL$()$

for i in range$($n$)$:

self.assertEqual$($len$($pq$),$ i$)$

pq$.$insert$($str$($i$),$ i$)$

# Removes entries one at a time

old $=$ pq$.$find$\_$min$()$

for i in range$($n$)$:

peek $=$ pq$.$find$\_$min$()$

new $=$ pq$.$remove$\_$min$()$

assert new $==$ peek

assert old.priority new.priority # make sure we are removing in order

old $=$ new

def test$\_$add$\_$remove$\_$random$($self$)$:

$"""$Randomly adds, then removes, a large number of items"""

# Construct PQ

n $=100$

pq $=$ PQ$\_$UL$()$

for i in range$($n$)$:

pq$.$insert$(\text{'}$pikachu$\text{'},$ random.randint$(0,$ n$))$

# Removes entries one at a time

old $=$ pq$.$find$\_$min$()$

for i in range$($n$)$:

peek $=$ pq$.$find$\_$min$()$

new $=$ pq$.$remove$\_$min$()$

assert new $==$ peek

assert old.priority new.priority # make sure we are removing in order

old $=$ new

class TestPQ$\_$OL$($unittest$.$TestCase$)$:

def test$\_$add$\_$remove$\_$sequential$($self$)$:

$"""$Adds and removes items sequentially"""

# Construct PQ

n $=1000$

pq $=$ PQ$\_$OL$()$

for i in range$($n$)$:

self.assertEqual$($len$($pq$),$ i$)$

pq$.$insert$($str$($i$),$ i$)$

# Removes entries one at a time

old $=$ pq$.$find$\_$min$()$

for i in range$($n$)$:

peek $=$ pq$.$find$\_$min$()$

new $=$ pq$.$remove$\_$min$()$

assert new $==$ peek

assert old.priority new.priority # make sure we are removing in order

old $=$ new

def test$\_$add$\_$remove$\_$random$($self$)$:

$"""$Randomly adds, then removes, a large number of items"""

# Construct PQ