Computer science

$|$Costs for in$-$house development

As standard practice, use these costs for all inhouse development

$\backslash$table$[[,$Cost per hour,$],[,$lfor first vear$),],[$Database Development,$$,60],[$Web developers,$$,75],[$App developers,$$,75],[$UX designers,$$,60],[$Business Analyst,$$,50],[$Trainers$,$$$,50],[$Cybersecurity specialists,$$,90],[$System Admin,$$,70]]$

Standard Development Tin

As standard practice, use these guic work per day$).$

Database design

Database build

Design of a report $($web or app$)$

Design of data entry page $($web or

Design of static text page $($web or a

Build of a report $($web or app$)$

Build of data entry page $($web or ap

Build of static text page $($web or ap

Connection to separate system or

admin$)$

Analucic work thoth wab and ane of

is $|)=4|(z_1{z}_2|$ :$\text{'}$ Then

nubatrings $-("$white dog"$)$

If comma, so substrings "white", $"$ doq"$)($note the leabing spoce in the second sutatring$)$ second comima, and Is an empty string becaus last substring is empty?

Ulse the provided code template and complete it to write a C program that does the following

It it defines a function named split, string with the following protatype: $q,$

Monopoly Profit Maximization

The table below provides partial information for Putrid Gas & Electric, a monopoly operati the northwestern United States. The executives at Putrid would not divulge any more inform than given in this table, so it is up to you to fill in the holes. Complete the table and use it to answer the questions that follow. $($The output is electricity in thousands of kilowatt hours.$)$

$\backslash$table$[[$Output$,$Price,TR$,$MR$,$TC$,$ATC,MC$,$Profit$],[0,x,,x,110,x,x,],[1,,,90,,$$$144,,],[2,,,,,,29,-3],[3,80,,,,,,42],[4,,300,,,56\mathrm{.}75,,89],[5,,,,261,,,],[6,,,40,301,,,],[,6n,,,348\mathrm{.}5,,,]]$

Question $5$ An array contains $n$ numbers ranging from $0$ to $n-2.$ There is exactiy one number dupllatad in the array. How do you find the duplicated number? For example, if an array with length $5$ contains numbers $,$

$1,3,2),$ the duplicated number is $2.$

Suppose that the duplicated number in the array is $m.$ The sum of all numbers in the array, denoted as num$1,$ should be the result of $0+1+$dots$+(n-2)+m.$ It is not difficult to get the sum result of $0+1+$dots$+(n-2),$ which is denoted as sum$2.$ The duplicated number $m$ is the difference between sumt and num$2.$ The corresponding code in Java is shown in Listing $3-2.$

Listing $3-2.$ Java Code to Get a Duplicated Number in an Array

int duplicate$($int numbers$[])1$

int length $=$ numbers. length;

int ${\displaystyle \underset{?}{\overset{?}{}}}=0$;

int sum $s{\displaystyle \underset{\phantom{}}{\overset{\phantom{}}{}}}1=0$;; i length; $++i)$

if$($numbers $1$ o II numbers $[1]>$ length $-2)$

throd nex Iilegalasguientexception$("$Invalid numbers."$)$