please help fix my code this is the error i get, Test Failed: Failed to import test module: test$\_$a$1$

Traceback $($most recent call last$)$:

File $"/$usr$/$lib$/$python$3\mathrm{.}10/$unittest$/$loader$.$py$",$ line $436,$ in $\_$find$\_$test$\_$path

module $=$ self.$\_$get$\_$module$\_$from$\_$name$($name$)$

File $"/$usr$/$lib$/$python$3\mathrm{.}10/$unittest$/$loader$.$py$",$ line $377,$ in $\_$get$\_$module$\_$from$\_$name

$\_\_$import$\_\_($name$)$

File $"/$autograder$/$source$/$tests$/$test$\_$a$1.$py$",$ line $17,$ in

import assignment$1$ as a$1\_$student

ModuleNotFoundError: No module named 'assignment$1\text{'}.$ I can fix it ill add my code below!# Name:

# OSU Email:

# Course: CS$261-$ Data Structures

# Assignment:Assignment $1$

# Due Date:$01-29-2024$

# Description:Assignment $1$

import random

from static$\_$array import $*$

# $-------------------$ PROBLEM $1-$ MIN$\_$MAX $-----------------------------------$

def min$\_$max$($arr: StaticArray$)->($int$,$ int$)$:

$"""$

Write function receives a one$-$dimensional array of integers and returns a

Python tuple with two values being min and max of the array

$"""$

minimum $=$ arr.get$(0)$

maximum $=$ arr.get$(0)$

for i in range$($arr$.$length$())$:

if arr.get$($i$)<$ minimum:

minimum $=$ arr.get$($i$)$

elif arr.get$($i$)>$ maximum:

maximum $=$ arr.get$($i$)$

return $($minimum$,$ maximum$)$

import assignment$1$ as a$1\_$student

# $-------------------$ PROBLEM $2-$ FIZZ$\_$BUZZ $---------------------------------$

def fizz$\_$buzz$($arr: StaticArray$)->$ StaticArray:

$"""$

Function that receives a StaticArray of integers, returns a new StaticArray object

and modifies it by

If number is divisable by $3$ element in new array is fizz

If number is divisable by $5$ element in new array is buzz

If number is a multiple and $3$ and $5,$ element in new array is fizzbuzz

All other cases element in new array has same value as original array

$"""$

new$\_$arr $=$ StaticArray$($arr$.$length$())$

for i in range$($arr$.$length$())$:

if arr.get$($i$)\%3==0$ and arr.get$($i$)\%5==0$:

new$\_$arr.set$($i$,$ "fizzbuzz"$)$

elif arr.get$($i$)\%3==0$:

new$\_$arr.set$($i$,$ "fizz"$)$

elif arr.get$($i$)\%5==0$:

new$\_$arr.set$($i$,$ "buzz"$)$

else:

new$\_$arr.set$($i$,$ arr.get$($i$))$

return new$\_$arr

# $-------------------$ PROBLEM $3-$ REVERSE $-----------------------------------$

def reverse$($arr: StaticArray$)->$ None:

$"""$

Function receives StaticArray reverses order of elements in the array

$"""$

for i in range$($arr$.$length$()//2)$:

temp $=$ arr.get$($i$)$

arr.set$($i$,$ arr.get$($arr$.$length$()-1-$i$))$

arr.set$($arr$.$length$()-1-$i$,$ temp$)$

# $-------------------$ PROBLEM $4-$ ROTATE $------------------------------------$

def rotate$($arr: StaticArray, steps: int$)->$ StaticArray:

$"""$

Function that receives two parameters being StaticArray and integer called steps

Creates new array containing original elements shifted left or right by steps

If steps positive rotate right, left if negative

$"""$

new$\_$arr $=$ StaticArray$($arr$.$length$())$

for i in range$($arr$.$length$())$:

new$\_$index $=($i $+$ steps$)\%$ arr.length$()$

new$\_$arr.set$($new$\_$index, arr.get$($i$))$

return new$\_$arr

# $-------------------$ PROBLEM $5-$ SA$\_$RANGE $----------------------------------$

def sa$\_$range$($start: int, end: int$)->$ StaticArray:

$"""$

Function that receives the two integers start and end and returns StaticArray

containing all consecutive integers start and end $0($N$)$ complexity

$"""$

arr $=$ StaticArray$($end $-$ start $+1)$

for i$,$ j in enumerate$($range$($start$,$ end $+1))$:

arr.set$($i$,$ j$)$

return arr

# $-------------------$ PROBLEM $6-$ IS$\_$SORTED $---------------------------------$

def is$\_$sorted$($arr: StaticArray$)->$ int:

$"""$

Function receives StaticArray and returns integer returns array that describes

if array is sorted: $1$ if ascending, $-1$ descending and $0$ otherwise

$"""$

ascending $=$ True

descending $=$ True

for i in range$(1,$ arr.length$())$:

if arr.get$($i$)<$ arr.get$($i $-1)$:

ascending $=$ False

if arr.get$($i$)>$ arr.get$($i $-1)$:

descending $=$ False

if not ascending and not descending:

return $0$

return $1$ if ascending else $-1$

# $-------------------$ PROBLEM $7-$ FIND$\_$MODE $-----------------------------------$

def find$\_$mode$($arr: StaticArray$)->($int$,$ int$)$:

$"""$

Receives StaticArray sorted in order either non$-$descending or non$-$ascending

Returns mode of array and its frequency in that order

$"""$

max$\_$count $=1$

current$\_$count $=1$

mode $=$ arr.get$(0)$

for i in range$(1,$ arr.length$())$:

if arr.get$($i$)==$ arr.get$($i $-1)$:

current$\_$count $+=1$

if current$\_$count $>$ max$\_$count:

max$\_$count $=$ current$\_$count

mode $=$ arr.get$($i$)$

else:

current$\_$count $=1$

return $($mode$,$ max$\_$count$)$

# $-------------------$ PROBLEM $8-$ REMOVE$\_$DUPLICATES $-------------------------$

def remove$\_$duplicates$($arr: StaticArray$)->$ StaticArray:

$"""$

Function receives a StaticArray already