Please create a Python that will take in the attached list $($assignment$6\_$list.txt$)$ and

create a program that will put the random words from the text file into a list to be

sorted. Once the list is created you will perform timing tests for the following sorting

algorithms:

a$.$ Bubble Sort

b$.$ Selection Sort

c$.$ Quick Sort

d$.$ Heap Sort

You are to create timing tests of each sorting algorithm using big$-$O notation and rank

them from fastest to the slowest as they relate to the time it takes to complete.

Please show the program running $($with screenshots$)$ along with the code.

assignment$6\_$list.txt:

ice

no

earthquake

lobby

genuine

orientation

mother

kitchen

passage

agent

disappear

guest

powder

crowd

feedback

blow

prosecution

notion

substitute

hostage

torture

troop

tool

dividend

tank

ecstasy

context

flow

mean

parachute

bulb

pest

cruelty

blind

burn

mix

tent

sign

slide

critic

idea

census

reception

occupation

bite

sensitivity

redundancy

book

volume

observation

wedding

sustain

formation

trustee

monopoly

weak

retirement

contemporary

profit

knowledge

glasses

freight

base

hour

terrace

hit

capital

wire

fur

cooperative

extraterrestrial

coin

bat

year

range

carriage

smash

buffet

slippery

pat

code

monarch

nightmare

tip

spot

oppose

call

crop

smooth

prevalence

norm

quiet

circumstance

block

us

store

slime

kid

spell

auditor