Use the following transactions to complete the first month of the Billy Bob’s Barber Shop.

Feb. 1 Billy Bob purchased 40 bottles of shampoo/conditioner for $5/each. The bottles of shampoo/conditioner are to be held for resale. Billy uses the perpetual method. Billy uses the FIFO method to account for inventory.

8. Sold 22 bottles of the shampoo/conditioner at a price of $10/bottle receiving cash.

10. Billy Bob purchased 20 bottles of shampoo/conditioner for $5.50/each. The bottles of shampoo/conditioner are to be held for resale.

16. Sold 25 bottles of the shampoo/conditioner at a price of $12/bottle receiving cash

25. Purchased 20 bottles of shampoo/conditioner on account. The price was $6/each.The bottles of shampoo/conditioner are to be held for resale.

26. Sold 15 bottles of the shampoo/conditioner at a price of $10/bottle receiving cash

PC Connection and CDW are two online retailers that compete in an Internet market for digital cameras. While the products they sell are similar, the firms attempt to differentiate themselves through their service policies. Over the last couple of months, PC Connection has matched CDW’s price cuts, but has not matched its price increases. Suppose that when PC Connection matches CDW’s price changes, the inverse demand curve for CDW’s cameras is given by P = 1,000 - 2Q. When it does not match price changes, CDW’s inverse demand curve is P = 700 -0.5Q. Based on this information, determine CDW’s inverse demand function over the last couple of months.

I got the first part, P=700-.5Q if Q is less than or equal to 200, and 1000-2Q if Q is greater than or equal to 200. I can't figure out how to find the range in which changes in marginal cost have no effect on CDW's profit-maximizing level of output.

The following data was collected to explore how the number of square feet in a house, the number of bedrooms, and the age of the house affect the selling price of the house. The dependent variable is the selling price of the house, the first independent variable (x1x1) is the square footage, the second independent variable (x2x2) is the number of bedrooms, and the third independent variable (x3x3) is the age of the house.

Copy Data

Find the p-value for the regression equation that fits the given data. Round your answer to four decimal places.

If the relationship is statistically significant, indicate the multiple regression equation that best fits the data, rounded to 3 decimal places.

n July 2007, Apple released the iPhone at a price of $599. Only two months later, the company dropped the price by 33% to $399. The early iPhone customers were angry about the sudden drop in price and felt they had overpaid for the product. See the letter below that Steve Jobs wrote to these customers. not surprisingly, members of the news media received the message and shared it with the general public.

INSTRUCTIONS: Write a clear and concise assessment of whether or not you think this is an effective business communication. Provide support for your answer. Organize your response into a clear introduction, body, and conclusion. Use the appropriate format for business writing.

***

Letter from Steve Jobs

To All iPhone Customers:

I have received hundreds of emails from iPhone customers who are upset about Apple dropping the price of the iPhone by $200 two months after it went on sale. After reading every one of these emails, I have some observations and conclusions.

First, I am sure that we are making the correct decision to lower the price of the 8GB iPhone from $599 to $399, and that now is the right time to do it. iPhone is a breakthrough product, and we have the chance to "go for it" this holiday season. iPhone is so far ahead of the competition, and now it will be affordable by even more customers. It benefits both Apple and every iPhone user to get as many new customers as possible in the iPhone "tent." We strongly believe the $399 price will help us do just that this holiday season.

Second, being in technology for 30+ years I can attest to the fact that the technology road is bumpy. There is always change and improvement, and there is always someone who bought a product before a particular cutoff date and misses the new price or the new operating system or the new whatever. This is life in the technology lane. If you always wait for the next price cut or to buy the new improved model, you'll never buy any technology product because there is always something better and less expensive on the horizon. The good news is that if you buy products from companies that support them well, like Apple tries to do, you will receive years of useful and satisfying service from them even as newer models are introduced.

Third, even though we are making the right decision to lower the price of iPhone, and even though the technology road is bumpy, we need to do a better job taking care of our early iPhone customers as we aggressively go after new ones with a lower price. Our early customers trusted us, and we must live up to that trust with our actions in moments like these.

Therefore, we have decided to offer every iPhone customer who purchased an iPhone from either Apple or AT&T, and who is not receiving a rebate or any other consideration, a $100 store credit towards the purchase of any product at an Apple Retail Store or the Apple Online Store. Details are still being worked out and will be posted on Apple's website next week. Stay tuned. We want to do the right thing for our valued iPhone customers.

We apologize for disappointing some of you, and we are doing our best to live up to your high expectations of Apple.

Steve Jobs

Apple CEO

Background: Despite their antimicrobial potential, vaginal lactobacilli often fail to retain dominance, resulting in overgrowth of the vgna by other bacteria, as observed with bacterial vaginosis. It remains elusive however to what extent interindividual differences in vaginal Lactobacillus community composition determine the stability of this microflora. In a prospective cohort of pregnant women we studied the stability of the normal vaginal microflora (VMF) (assessed on Gram stain) as a function of the presence of the vaginal Lactobacillus index species (determined through culture and molecular analysis with tRFLP).

Results: From 100 consecutive Caucasian women vaginal swabs were obtained at mean gestational ages of 8.6 (SD 1.4), 21.2 (SD 1.3), and 32.4 (SD 1.7) weeks, respectively. Based on Gram stain, 77 women had normal or Lactobacillus-dominated vaginal microflora (VMF) during the first trimester of which 56 remained normail in the third trimester. Th3 remaining 23 women tested abnormal in the first trimester and 13 of them converted in the second or third trimester.

Test the null hypothesis that having an abnormal result in the first trimester is related to having an abnormal result in the third trimester (Hint: What type of chi-square test is this?). (5 pts).

(Using C++)

Sample array: 100, 45, 33, 55, 356, 11, 1000, 999, 987

You need to perform the following steps to evaluate the algorithm’s time complexity:

1. Pick any two sorting algorithms (e.g., merge sort, bubble sort).
2. Find the algorithm implementation.
3. Create the array, and store all of the elements described above.
4. Pass the array into the first sorting algorithm.
5. Pass the array into the second sorting algorithm.
6. Calculate the execution time for the first sorting algorithm’s execution.
7. Calculate the execution time for the second sorting algorithm’s execution.

You need to recommend the sorting algorithm that should be used for sorting based on its execution time.

Note that you can use any programming language to implement the steps above.

Your program should contain the following:

• The implementation of the first sorting algorithm
• The implementation of the second sorting algorithm
• An array that can store all of the elements from the sample array

Your program should also do the following:

• Store the start transaction before executing the sorting algorithm, and insert the end transaction afterward
• Calculate the difference between end_transaction and start_transaction
• Pick the sorting algorithm that has the lower execution time

Using a Java.

2. Write a Java program calculate_fare.java to take the input for number of miles, and the class of journey (1,2, or 3, for first, second, and third class respectively), for a train journey.

The program should then calculate and display the fare of journey based on the following criteria:
Note: Use Switch...case and if...else construct

Rubric:
- Input, usage of appropriate data types - 2 points
- Appropriate usage of if...else in each case of switch construct for each class of journey : 4 points
- Documentation and appropriate variable names- 2 points

The layout of  switch case should be as follows:

switch(cls)//class

{

     case 1: if construct for calculating fare for class 1

     case 2: if construct for calculating fare for class 2

     case 3: if construct for calculating fare for class 3

     default: Display it is an invalid class

}

STRICT DOWNVOTE IF NOT DONE FULLY, WILL REPORT ALSO IF COPY PASTED OR MODIFIED ANSWER Develop a class, using templates, to provide functionality for a set of recursive functions. The functions specified as recursive must be written recursively (not iterativly). The UML class specifications are provided below. A main will be provided. Additionally, a make file will need to be developed and submitted. ● Recursion Set Class The recursion set template class will implement the template functions. recursionSet -length: int -*mySet: myType -MAX_VALUE = 500000 static const: int -LIMIT = 1000 static const: int +recursionSet() +recursionSet(const recursionSet&) +~recursionSet() +getSetLength() const: int +generateElements(int): void + getElement(int) const: myType +setElement(int, myType): void +readValue(const string) const: int +printSet() const: void +operator == (const recusrionSet&): bool +tak(myType, myType, myType) const: myType +printSeptenary(myType) const: void +squareRoot(myType, myType) const: myType -recSqRoot(myType, myType, myType) const: myType +recursiveSum() const: myType -rSum(int) const: myType +checkParentheses(string) const: bool -recChkPar(string, int, int) const: bool +recursiveInsertionSort(): void -recInsSort(int, int): void -insertInOrder(myType, int, int): voidYou may add additional private functions if needed (but, not for the recursive functions). Note, points will be deducted for especially poor style or inefficient coding. Function Descriptions • The recursionSet() constructor should set the length to 0 and mySet pointer to NULL. • The recusrsionSet(const recursionBucket&) copy constructor should create a new, deep copy from the passed object. • The ~recursionSet() destructor should delete the myType array, set the pointer to NULL, and set the size to 0. • The setElement(int, myValue) function should set an element in the class array at the given index location (over-writing any previous value). The function must include bounds checking. If an illegal index is provided, a error message should be displayed. • The getElement(int) should get and return an element from the passed index. This must include bounds checking. If an illegal index is provided, a error message should be displayed and a 0 returned. • The getSetLength() functions should return the current class array length. • The printSet(int) function should print the formatted class array with the passed number of values per line. Use the following output statement: cout << setw(5) << mySet[i] << " • "; Refer to the sample executions for formatting example. The readValue(string) function should prompt with the passed string and read a number from the user. The function should ensure that the value is 3 1 and £ MAX_VALUE. The function should handle invalid input (via a try/catch block). If an error occurs (out of range or invalid input) an appropriate message should be displayed and the user re- prompted. Example error messages include: cout << "readSetLenth: Sorry, too many " << "errors." << endl; cout << "readSetLenth: Error, value " << cnt << " not between 1 and " << numMax << "." << endl; • Note, three errors is acceptable, but a fourth error should end the function and return 0. The generateList(int) function should dynamically create the array and use the following casting for rand() to fill the array with random values. mySet[i] = static_cast(rand()%LIMIT); • • • The printSeptenary(myType) function should print the passed numeric argument in Septenary (base-7) format. Note, function must be written recursively. The recursiveSum() function will perform a recursive summation of the values in class data set and return the final sum. The function will call the private rSum(int) function (which is recursive). The rSum(int) function accepts the length of the data set and performs a recursive summation. The recursive summation is performed as follows: rSum ( position )= • { array[ 0] array[ position ] + rSum ( position−1) if position = 0 if position > 0 The tak(myType) function should recursively compute the Tak 1 function. The Tak function is defined as follows: tak ( x , y , z) = { z tak ( tak ( x−1, y , z) , tak ( y−1, z , x) , tak ( z −1, x , y ) ) 1 For more information, refer to: http://en.wikipedia.org/wiki/Tak_(function) if y≥ x if y < x• • The squareRoot(myType, myType) function will perform a recursive estimation of the square root of the passed value (first parameter) to the passed tolerance (second parameter). The function will call the private sqRoot(myType,myType,myType) function (which is recursive). The private recSqRoot(myType,myType,myType) function recursively determines an estimated square root. Assuming initially that a = x, the square root estimate can be determined as follows: recSqRoot ( x , a , epsilon) = • • • • • { 2 if ∣ a − x ∣ ≤ epsilon a 2 (a + x) sqRoot x , , epsilon 2 a ( ) if ∣ a 2 − x ∣ > epsilon The recursiveInsertionSort() function should sort the data set array using a recursive insertion sort. The recursiveInsertionSort() function should verify the length is valid and, if so, call the recInsSort() function to perform the recursive sorting (with the first element at 0 and the last element at length-1). The recInsSort(int, int) function should implement the recursive insertion sort. The arguments are the index of the first element and the index of the last element. If the first index is less than that last index, the recursive insertion sort algorithm is follows: ▪ Recursively sort all but the last element (i.e., last-1) ▪ Insert the last element in sorted order from first through last positions To support the insertion of the last element, the insertInOrder() function should be used. The insertInOrder(myType, int, int) function should recursively insert the passed element into the correction position. The arguments are the element, the starting index and the ending index (in that order). The function has 3 operations: ▪ If the element is greater than or equal to the last element in the sorted list (i.e., from first to last). If so, insert the element at the end of the sorted (i.e, mySet[last+1] = element). ▪ If the first is less than the last, insert the last element (i.e., mySet[last]) at the end of the sorted (i.e., mySet[last+1] = mySet[last]) and continue the insertion by recursively calling the insertInOrder() function with the element, first, and last-1 values. ▪ Otherwise, insert the last element (i.e., mySet[last]) at the end of the sorted (i.e., mySet[last+1] = mySet[last]) and set the last value (i.e., mySet[last]) to the passed element. The checkParentheses(string) function should determine if the parentheses in a passed string are correctly balanced. The function should call the private recChkPar(string, int, int) function (which is recursive) The recChkPar(string, int, int) function should determine if the parentheses in a string are correctly balanced. The arguments are the string, an index (initially 0), and a parenthesis level count (initially 0). The index is used to track the current character in the string. The general approach should be as follows: ◦ Identify base case or cases. ◦ Check the current character (i.e., index) for the following use cases: ▪ if str[index] == '(' → what to do then ▪ if str[index] == ')' → what to do then ▪ if str[index] == any other character → what to do then Note, for each case, increment the index and call function recursively.