QUESTION :

Coursehelp
May 13, 2019
QUESTION : No Comments

(Solved) : Would Like Help Getting Code Question C Benchmarsk Sorting Methods Listed Using Visual St Q29139380 . . .

I would like some help getting the code for the question belowin C++.

Benchmarsk each of the sorting methods listed below using visualstudio.

Insertion Sort, Bubble Sort Heap Sort. Quick Sort. MergeSort.

Benchmark each of the above sorting methods for data sizes of10000, 20000, 30000, 40000 and 50000. Display the results in atable as shown below. The table should have rows and columns.However, the rows and columns need not be separated by lines.
  

Data Size

Heap Sort Time In Seconds

Merge Sort Time In Seconds

Quick Sort Time In Seconds

Quadratic Sort Time In Seconds

100000

200000

300000

400000

500000

Notes:

? Do not use a local array for keeping data values. Use a globalarray for this purpose. You can use dynamically allocated arrays ifyou wish.

Generate the data using a random generator and store it in aglobal array for use in sorting. If you use a local array of largesize, you will run out of stack space.

? Calculate the time taken by a sort routine in seconds asbelow:

#include

clock_t start, finish;
start =clock( ); //time in milliseconds
sort( );
finish=clock( ); //time in milliseconds
//the constant CLOCKS_PER_SEC below is equal to 1000
double duration = (double) ( (finish-start)/CLOCKS_PER_SEC );//time in secs.

Expert Answer


. . .

READ MORE
Coursehelp
QUESTION : No Comments

(Solved) : Would Remove List Dupliactes Objects Arraylist Using Linkedhash Set Java Q27920790 . . .

How would you remove a list of dupliactes objects in a ArrayListusing linkedhash set in JAVA ?

Expert Answer


. . .

READ MORE
Coursehelp
QUESTION : No Comments

(Solved) : Write Arm Assembly Code Subroutine Approximate Square Root Argument Using Bisection Method Q31337991 . . .

Write an ARM Assembly code subroutine to approximate the squareroot of an argument using the bisection method. Your code mustapproximate the square root of an integer between 0 and 2^(31) -1.Using integer maths is sufficient (no floating point or fractionsare required); your code will return the truncated (integerportion) of the square root.

Base your software on the following pseudocode:

INPUT: Argument x, endpoint values a, b, such that a < b OUTPUT: value which differs from sqrt(x) by less than 1 done 0 a0 b = square root of largest possible argument (eg,-216) C-1 do t c old <- c <- (a+b)/2 done 1 } else if (c*c < x) { a <- C else ( b<-c while (Idone) && (ccold) return c

INPUT: Argument x, endpoint values a, b, such that a Show transcribed image text INPUT: Argument x, endpoint values a, b, such that a

Expert Answer


. . .

READ MORE
Coursehelp
QUESTION : No Comments

(Solved) : Write Arm Assembly Language Routine Count Number 1s 32 Bit Word R0 Return Result R1 Code F Q34564596 . . .

Write an ARM assembly language routine to count the number of 1sin a 32‐bit word in r0 and return the result in r1.

code:

LDR r0, 0x11AB003F dummy value for rl (11 ones) MOV r1,#0x0 MOV r2,#32 MOVS r0,r0, ROR #1 ADDCS r1,r1,#1 SUBS r2 , r2 , #1 BNE OnesCount ; clear ones counter ;use r2 as the loop counter i Repeat: rotate ro right set Ilags ;if carry set increment 1s counter ; decrement loop counter until all bits tested OnesCount If this was a subroutine Count, the code might be area test, cODE, readwrite ADR sp, Stackl LDR r2 , =0xFFFFFFFF STR r2, [sp] LDR r0, - 0xFFAB123A BL MOV r3,rl NOP NOP ;set up dummy r2 ; dummy data :call routine ; read result Count STMFD sp!, (r2,lr] MOV r1, #0x0 MOV r2,#4 Count ; save r2 and return on the stack onesCount MOVS r0,r0, ROR #1 ADDCS r1,r1,#1 SUBS r2 , r2 , #1 BNE OnesCount LDMFD sp!, (r2,pc) ; restore r2 and returr Stack Stackl DCD 0,0,0,0,0 DCD 0,0,0,0,0

The following image is a screendump after executing the abovecode. Register r3 contains 0x13 which is 19, the
number of 1s in 0x11AB003F.

CAUsers AlanCore7 Desktop ForBrusselsMay2012Chap3Problems.uvproj - pVision4 File Edit iew Project Flash Debug Peripherals Tools SVCS Window Help Registers 3Chap3Problems.asm area test, CoDE, readwrite ADR p, Stackl LDR r2,=0xEEEEEEEE STR r2, [ap] LDR ro, - 0XEEAB123A ;dummy data BL Count MOV 3,rl B Parkilere RegisterValue0 Current OF FAB123A 0x00000013 :set up dumay x2 R1 000000013 call routine : read result endless loop R4 R5 R6 R7 R8 R9 R10 R11 R12 R13 (5P) 0x00000054 R14 (LR) 000000014 R15 (PC) 000000018 0 ParkHere NOP 0 count STMED sp!, 2,1x) MOV Nov saver and return on the stacik r1, #0x0 r2, #32 13 onescount Movs ro,r0 , ROR #1 ADDcs r1,r1, #1 SUBS r2, r2, 1 BNE Onescount 15 restore r2 and return Stack DCD o,o, o, 0,0 User/System Fast Interrupt Interrupt 20 Stack DCD 0,0,0,0,0 21 END Project E Registers Simulation

LDR r0, 0x11AB003F dummy value for rl (11 ones) MOV r1,#0x0 MOV r2,#32 MOVS r0,r0, ROR #1 ADDCS r1,r1,#1 SUBS r2 , r2 , #1 BNE OnesCount ; clear ones counter ;use r2 as the loop counter i Repeat: rotate ro right set Ilags ;if carry set increment 1s counter ; decrement loop counter until all bits tested OnesCount If this was a subroutine Count, the code might be area test, cODE, readwrite ADR sp, Stackl LDR r2 , =0xFFFFFFFF STR r2, [sp] LDR r0, – 0xFFAB123A BL MOV r3,rl NOP NOP ;set up dummy r2 ; dummy data :call routine ; read result Count STMFD sp!, (r2,lr] MOV r1, #0x0 MOV r2,#4 Count ; save r2 and return on the stack onesCount MOVS r0,r0, ROR #1 ADDCS r1,r1,#1 SUBS r2 , r2 , #1 BNE OnesCount LDMFD sp!, (r2,pc) ; restore r2 and returr Stack Stackl DCD 0,0,0,0,0 DCD 0,0,0,0,0 CAUsers AlanCore7 Desktop ForBrusselsMay2012Chap3Problems.uvproj – pVision4 File Edit iew Project Flash Debug Peripherals Tools SVCS Window Help Registers 3Chap3Problems.asm area test, CoDE, readwrite ADR p, Stackl LDR r2,=0xEEEEEEEE STR r2, [ap] LDR ro, – 0XEEAB123A ;dummy data BL Count MOV 3,rl B Parkilere RegisterValue0 Current OF FAB123A 0x00000013 :set up dumay x2 R1 000000013 call routine : read result endless loop R4 R5 R6 R7 R8 R9 R10 R11 R12 R13 (5P) 0x00000054 R14 (LR) 000000014 R15 (PC) 000000018 0 ParkHere NOP 0 count STMED sp!, 2,1x) MOV Nov saver and return on the stacik r1, #0x0 r2, #32 13 onescount Movs ro,r0 , ROR #1 ADDcs r1,r1, #1 SUBS r2, r2, 1 BNE Onescount 15 restore r2 and return Stack DCD o,o, o, 0,0 User/System Fast Interrupt Interrupt 20 Stack DCD 0,0,0,0,0 21 END Project E Registers Simulation Show transcribed image text LDR r0, 0x11AB003F dummy value for rl (11 ones) MOV r1,#0x0 MOV r2,#32 MOVS r0,r0, ROR #1 ADDCS r1,r1,#1 SUBS r2 , r2 , #1 BNE OnesCount ; clear ones counter ;use r2 as the loop counter i Repeat: rotate ro right set Ilags ;if carry set increment 1s counter ; decrement loop counter until all bits tested OnesCount If this was a subroutine Count, the code might be area test, cODE, readwrite ADR sp, Stackl LDR r2 , =0xFFFFFFFF STR r2, [sp] LDR r0, – 0xFFAB123A BL MOV r3,rl NOP NOP ;set up dummy r2 ; dummy data :call routine ; read result Count STMFD sp!, (r2,lr] MOV r1, #0x0 MOV r2,#4 Count ; save r2 and return on the stack onesCount MOVS r0,r0, ROR #1 ADDCS r1,r1,#1 SUBS r2 , r2 , #1 BNE OnesCount LDMFD sp!, (r2,pc) ; restore r2 and returr Stack Stackl DCD 0,0,0,0,0 DCD 0,0,0,0,0
CAUsers AlanCore7 Desktop ForBrusselsMay2012Chap3Problems.uvproj – pVision4 File Edit iew Project Flash Debug Peripherals Tools SVCS Window Help Registers 3Chap3Problems.asm area test, CoDE, readwrite ADR p, Stackl LDR r2,=0xEEEEEEEE STR r2, [ap] LDR ro, – 0XEEAB123A ;dummy data BL Count MOV 3,rl B Parkilere RegisterValue0 Current OF FAB123A 0x00000013 :set up dumay x2 R1 000000013 call routine : read result endless loop R4 R5 R6 R7 R8 R9 R10 R11 R12 R13 (5P) 0x00000054 R14 (LR) 000000014 R15 (PC) 000000018 0 ParkHere NOP 0 count STMED sp!, 2,1x) MOV Nov saver and return on the stacik r1, #0x0 r2, #32 13 onescount Movs ro,r0 , ROR #1 ADDcs r1,r1, #1 SUBS r2, r2, 1 BNE Onescount 15 restore r2 and return Stack DCD o,o, o, 0,0 User/System Fast Interrupt Interrupt 20 Stack DCD 0,0,0,0,0 21 END Project E Registers Simulation

Expert Answer


. . .

READ MORE
Coursehelp
QUESTION : No Comments

(Solved) : Write Arm Program Armsim Following Read Text File Called Inputtxt String Characters Upperc Q32561711 . . .

Write an ARM program in ARMSim# that will do the following:​

Read the text from a file called “input.txt” as a string ofcharacters
Uppercase every consonant
Replace all vowels with an asterisk (*)
Output the new string from memory to a file called”output.txt”
For example:
“input.txt” contains “Blind love couldn’t win as the facts all camein. But I know I’ll again chase after wind. What have I got if nota thought?”
“output.txt” should contain “BL*ND L*V* C**LDN’T W*N *S TH* F*CTS*LL CAME *N. B*T * KN*W *’LL *G**N CH*S* *FT*R W*ND. WH*T H*V* *G*T *F N*T * TH**GHT?”
Meeting the above requirements is a bare minimum for theassignment. In order to get full credit, your program should:

have appropriate comments
check for errors
have a readable output
Please submit a single file called “project2.s” to theassignment.

Expert Answer


. . .

READ MORE
Coursehelp
QUESTION : No Comments

(Solved) : Write Arm Program Gcc Version 224 Syntax Asks User Enter Number Counts Number 1 User Enter Q26491464 . . .

Write an ARM program (GCC version 2.24 syntax) that asks theuser to enter a number and then counts down from that number to 1.If the user enters a number less than 1, the program must print anerror message before exiting. In addition to printing thecountdown, sum the numbers and print the resulting sum.

Expert Answer


. . .

READ MORE
Coursehelp
May 11, 2019
QUESTION : No Comments

(Solved) : Write Function Trainclassifier Trainingset Takes Single Argument Trainingset Name Csv File Q29596917 . . .

E Problemm program.pyB example tset.csv 1 from collections import defaultdict as dd 2 import csv 3 from hidden_lib 4 from math import sqrt 5 6 def normalise(counts dict) ? Write a function train_classifier (training_set) which takes the single argument training_set, the name of a CSV file as a string, and returns a dictionary of normalised trigram-counts (as dictionaries), that is the dictionary should have the format (lang1: trigram_counts1, lang2: trigram_counts2, ...1 import count trigrams normalise takes a dictionary of trigram counts counts_dict and normalises it by its length. mag sqrt (sum([x* *2 for x in counts_dict.values )])) return dd (int, (key: value/mag for (key, value) in counts dict.itemsO) The file training_set is of the following form: 9 langl, textl lang2, text2 lang3, text3 10 12 def train_classifier (training_set): 13 14 15 16 train classifier takes a csv filename training_set as a string and returns a dictionary of average trigram-counts per language. # your code here. pass noting that there may be more than one document per language For an example, see example_tset.csv, accessible as a tab at the top right. Note that the contents were taken from Wikipedia articles for the different languages. While the individual documents have been automatically stripped of a lot of the document markup they still include some formating characters and other noise, which will form part of the trigram counts. Though we wont do anything with it here, dealing with this kind of noise is an important part of the data wrangling step of data science. Submissions >Output ?Autosaved We have provided a (hidden) implementation of the function count_trigrams (doc) from the previous question in hidden_litb. This function takes a document (a string) and returns a default dictionary of trigram-counts for the trigrams within the string. Your code should behave as follows: >>>dtrain_classifier(example_ tset.csv) >>>d.keys () dict keys ([Indonesian, Icelandic, English]) >>> type(dEnglish]) <class collections.defaultdict>

Write a function train_classifier(training_set) which takes the single argument training_set, the name of a CSV file as a string, and returns a dictionary of normalised trigram-counts (as dictionaries), that is the dictionary should have the format {lang1:trigram_counts1, lang2: trigram_counts2, …}.

The file training_set is of the following form:

lang1,text1
lang2,text2
lang3,text3

noting that there may be more than one document per language.

For an example, see example_tset.csv, accessible as a tab at the top right. Note that the contents were taken from Wikipedia articles for the different languages. While the individual documents have been automatically stripped of a lot of the document markup, they still include some formating characters and other noise, which will form part of the trigram counts. Though we won’t do anything with it here, dealing with this kind of ‘noise’ is an important part of the data wrangling step of data science.

We have provided a (hidden) implementation of the function count_trigrams(doc) from the previous question in hidden_lib. This function takes a document (a string) and returns a default dictionary of trigram-counts for the trigrams within the string.

Your code should behave as follows:

>>> d = train_classifier('example_tset.csv')
>>> d.keys()
dict_keys(['Indonesian', 'Icelandic', 'English'])
>>> type(d['English'])
<class 'collections.defaultdict'>
>>>  d['English']['g t']
0.05794400216170997

Your code will be tested on a hidden training set which is much much larger than the example set. It contains 3331 documents from Wikipedias of 74 different languages. Consequently, the hidden test case might take a while to run.

Expert Answer

from collections import defaultdict as dd
import csv
from hidden_lib import count_trigrams
from math import sqrt . . . . .

READ MORE
Coursehelp
May 10, 2019
QUESTION : No Comments

(Solved) : Please Help Don T Know Much Answer Set Prolog 1 English Reading Following Rules Person X C Q31017005 . . .

Please help me, I don’t know much about Answer set Prolog.

1.What is the English reading for each of the followingrules?

person(X) :-child(X).

:-child(X), age(X, Y), Y >= 18.

-age(X, N) :-age(X, N1), N != N1.

age(leo, 35) | age(leo, 36).

adult(X) :-person(X),not child(X).

2.Write an ASP program that can determine if one person is afull brother, half-brother, or a step-brother of another person.The program you write should run with the DLV solver and shoulddefine three relations:

full_brother(X, Y)–X is a full brother of Y, i.e., a brotherborn of the same mother and father

half_brother(X, Y)–X is a half-brother of Y, i.e., a brotherrelated through one parent only

step_brother(X, Y)–X is a stepbrother of Y, i.e.,a son of one’sstepparent by another partner

to test your program, use the family information provided in thestarter file problem2.txt. Extend the starter file with your ownrules for the three relations above. You may add helper predicatesand rules as needed. Your solution may be tested on additionalfamily trees.

person(mary).
person(saul).
person(monica).
person(dan).
person(melinda).
person(andrew).
person(ben).
person(carmen).
person(david).
person(ethan).
person(frank).
sex(female).
sex(male).
sex_of(mary, female).
sex_of(monica, female).
sex_of(melinda, female).
sex_of(carmen, female).
% Closed World Assumption
sex_of(X, male) :- person(X), not sex_of(X, female).
mother(mary, andrew).
mother(mary, ben).
father(saul, andrew).
father(saul, ben).
mother(monica, carmen).
mother(monica, david).
mother(monica, ethan).
father(dan, carmen).
father(dan, david).
father(dan, ethan).
mother(melinda, frank).
father(dan, frank).
married(monica, saul).
married(melinda, dan).
% married is a symmetric relationmarried(X, Y) :- married(Y,X).

%—————————————————%
TODO:
% full_brother(X, Y) X is a full brother of Y,% i.e., a brotherwith the same mother and father as Y

% TODO:

% half_brother(X, Y) X is a half-brother of Y,% i.e., abrother related through one parent only

% TODO

% step_brother(X, Y) X is a stepbrother of Y, i.e.,% a son of one’s stepparent byanother partner

% You can add helper predicates and rules as needed

Expert Answer


. . .

READ MORE
Coursehelp
QUESTION : No Comments

(Solved) : Please Help Debug Following Program Add Code Create Menu Driven Interface User C Consoleap Q32276227 . . .

Please help debug the following program and add code to create amenu driven interface for the user in C++:

// ConsoleApplication1.cpp : This file contains the ‘main’function. Program execution begins and ends there.

//

#include “pch.h”

#include <iostream>

template <typename E> class Stack {

private:

int maxSize;

int top;

E *listArray;

void operator =(const Stack&) {}

Stack(const Stack&) {}

public:

Stack(int size = defaultSize)

{maxSize = size top = 0; listArray = new E[size];}

~Stack() { delete[] listArray; }

virtual void clear() { top = 0; }

virtual void push(const E& it) { Assert(top != maxSize,”Stack is full”); listArray[top++] = it; }

virtual E pop() { Assert(top != 0, “Stack is empty”); returnlistArray[–top]; }

const E& topValue() const {

Assert(top != 0, “Stack is empty”); return listArray[top -1];

}

virtual int length() const { return top; }

};

using namespace std;

int main()

{

  

;}

Expert Answer


. . .

READ MORE
Coursehelp
QUESTION : No Comments

(Solved) : Please Help Complete Fussiest Eater Function Well Delicious Function Data Needed Https Www Q36506122 . . .

The Eaters and the Eaten Function compute fussiest caters (eat data) Problem descrlption Your task in this assignment is to aPlease help me complete thefussiest eater function as well as the most delicious function!

All data needed is here:https://www.mediafire.com/folder/qn5fao1hzlxid/Definitions_and_Sets_Data

thank you so much in advance !!

This is the code i already have for the other functions(indentation may be messed up from copy paste):

import sys

def read_food_file(filename):
  
try:
file=open(filename)
except:
return {}
data={}
for line in file:
fields=line.strip().split(‘,’)
data[fields[0]]=fields[1:]
return data

def dump_data(eat_data):
#print(“– dump_data() not yet completed –“)
for i in sorted(eat_data):
data=sorted(eat_data[i])
print(i,’:’,’, ‘.join(data))

def compute_only_eaters(life):
#defining an empty list
eaters=[]
#looping through each key in dictionary
for i in life:
#assuming current creature is an eater only
is_eater_only = True
#looping through each key in dictionary again
for j in life:
#checking if i is in the eaten list of j
if i in life[j]:
#found, which means i is eaten by j, so not eater only
is_eater_only=False
break
#at the end of loop, if creature is is_eater_only, adding tolist
if is_eater_only:
eaters.append(i)

return eaters

def compute_only_eaten(life):
  
eaten=[]
#looping through each key in dictionary
for i in life:
#looping through each organisms eaten by i
for j in life[i]:
#if j is not in dict (means not eater) and not previously added toeaten
#adding to eaten
if j not in life and j not in eaten:
eaten.append(j)
return eaten

def compute_fussiest_eaters(life):
  

return []

def compute_most_delicious(life):
return []

def main():
filename = input(“Name of CSV file? “)
life = read_food_file(filename)
if life == {}:
sys.exit(1)

li = dump_data(life)
print()

li = compute_only_eaters(life)
print(“Only eaters:”, “, “.join(li))
print()

li = compute_only_eaten(life)
print(“Only eaten:”, “, “.join(li))
print()

li = compute_fussiest_eaters(life)
print(“Fussiest eaters:”, “, “.join(li))
print()

li = compute_most_delicious(life)
print(“Tastiest entry:”, “, “.join(li))

main()

The Eaters and the Eaten Function compute fussiest caters (eat data) Problem descrlption Your task in this assignment is to analyze the data on food-consumption behavior. Several files are provided containing data regarding which organisms eat which foods (with “foods” here possibly other organisms). The data itself is notrigorously scientific(!!) and is rather structured in a such a way as to give you practice working with Python programs using dictionaries and sets. This fourth function uses the dictionary constructed by read_food_file) and looks again at all of the eaters. However, the function will determine the eaters having the fewest number of items eaten. (Hint: You will want to compute the minimum of the eaten-item list lengths.) Once this is computed, the fussiest eaters are returned in a list in alphabetical order. For example, the output expected from this function given food01.csv is used by the main) function to produce this output line: All provided data files use a comma-separated format. Each line in the file contains data about the eating habits of an organism and is provided in this format: Fussiest eaters lion, zebra ceater>. , , ceaten n> For example, the third line in food81.csv is: Function compute most delicious (eat data) jackal,grass,zebra, gazelle This last function uses the dictionary constructed by read_food_file() and looks again at all of the eaten. However, the function will determine which, of those that are eaten, havethe largest number of eaters. (Hint: You may want to compute a local dictionary where each of the eaten is a key and the corresponding value is a list of those that eat the eaten.) Once computed, the most delicious of the eaten is returned in a list in alphabetical order. For example, the output expected from this function given food01.csv is used by the main) function to produce this output line: which means that jackals eat grass, zebras, and gazelles. The last line in foodo1.csv is: zebra,grass which means that zebras cat only grass. The completed program prompts the user for the name of a data file and will read the contents of that data file, ad create variables in a form suitable for computing the answer to some questions. Below is a transcript of one execution of a completed programi: Tastiest entr rass $ python assign6.ру Name of CSV file? tood01.cs gazelle: acacia leaves, grass jackal: gazelle, grass, zebra lion: gazelle zebra: grass What you are givern A starter program named assign6.py containing a main) function plus empty versions of the functions you must complete. Six comma-separate tet files The output expected from your program for each of the six provided data files. Only eaters: lion, jackal Only eaten: acacia leaves, grass Fussiest eaters: lion, zebra Tastiest entr What you are to submit A completed solution named assign& .py Please ensure your program only outputs data required by the assignment. Any extra print statements used for debugging must be either deieted or commented out before submission. . The functions listed in the remainder of this assignment description are best completed in their order of appearance Show transcribed image text The Eaters and the Eaten Function compute fussiest caters (eat data) Problem descrlption Your task in this assignment is to analyze the data on food-consumption behavior. Several files are provided containing data regarding which organisms eat which foods (with “foods” here possibly other organisms). The data itself is notrigorously scientific(!!) and is rather structured in a such a way as to give you practice working with Python programs using dictionaries and sets. This fourth function uses the dictionary constructed by read_food_file) and looks again at all of the eaters. However, the function will determine the eaters having the fewest number of items eaten. (Hint: You will want to compute the minimum of the eaten-item list lengths.) Once this is computed, the fussiest eaters are returned in a list in alphabetical order. For example, the output expected from this function given food01.csv is used by the main) function to produce this output line: All provided data files use a comma-separated format. Each line in the file contains data about the eating habits of an organism and is provided in this format: Fussiest eaters lion, zebra ceater>. , , ceaten n> For example, the third line in food81.csv is: Function compute most delicious (eat data) jackal,grass,zebra, gazelle This last function uses the dictionary constructed by read_food_file() and looks again at all of the eaten. However, the function will determine which, of those that are eaten, havethe largest number of eaters. (Hint: You may want to compute a local dictionary where each of the eaten is a key and the corresponding value is a list of those that eat the eaten.) Once computed, the most delicious of the eaten is returned in a list in alphabetical order. For example, the output expected from this function given food01.csv is used by the main) function to produce this output line: which means that jackals eat grass, zebras, and gazelles. The last line in foodo1.csv is: zebra,grass which means that zebras cat only grass. The completed program prompts the user for the name of a data file and will read the contents of that data file, ad create variables in a form suitable for computing the answer to some questions. Below is a transcript of one execution of a completed programi: Tastiest entr rass $ python assign6.ру Name of CSV file? tood01.cs gazelle: acacia leaves, grass jackal: gazelle, grass, zebra lion: gazelle zebra: grass What you are givern A starter program named assign6.py containing a main) function plus empty versions of the functions you must complete. Six comma-separate tet files The output expected from your program for each of the six provided data files. Only eaters: lion, jackal Only eaten: acacia leaves, grass Fussiest eaters: lion, zebra Tastiest entr What you are to submit A completed solution named assign& .py Please ensure your program only outputs data required by the assignment. Any extra print statements used for debugging must be either deieted or commented out before submission. . The functions listed in the remainder of this assignment description are best completed in their order of appearance

Expert Answer


. . .

READ MORE
1 2 3 51,615