Here is a forecast of sales by National Bromide for the first 4 months of 2019 (figures in thousands of dollars):

On average, 60% of credit sales are paid for in the current month, 20% in the next month, and the remainder in the month after that. What are the expected cash collections in months 3 and 4? (Enter your answers in whole dollars not in thousands of dollars.)

Expected cash collections

Month 3

Month 4

I am having trouble differentiating these. Can someone provide steps for these? I only need 1-3, 4 is always rejecting or failing to reject null.

- Hypothesis testing (4 steps) for comparing variances when sample sizes are equal.

- Hypothesis testing (4 steps) for comparing variances when sample sizes are not equal.

- Hypothesis testing (4 steps) with the independent-measures t statistic (variances assumed unequal). Be able to compute effect size using r^2.

Thank you :)

1. Cash Payback Period, A method of analysis of proposed capital investments that focuses on the present value of the cash flows expected from the investments.Net Present Value Method, and Analysis

   Elite Apparel Inc. is considering two investment projects. The estimated net cash flows from each project are as follows:

   Year	Plant Expansion			Retail Store Expansion
   1		$450,000			$500,000
   2		450,000			400,000
   3		340,000			350,000
   4		280,000			250,000
   5		180,000			200,000
   Total		$1,700,000			$1,700,000

   Each project requires an investment of $900,000. A rate of 15% has been selected for the net present value analysis.

   Present Value of $1 at Compound Interest
   Year	6%	10%	12%	15%	20%
   1	0.943	0.909	0.893	0.870	0.833
   2	0.890	0.826	0.797	0.756	0.694
   3	0.840	0.751	0.712	0.658	0.579
   4	0.792	0.683	0.636	0.572	0.482
   5	0.747	0.621	0.567	0.497	0.402
   6	0.705	0.564	0.507	0.432	0.335
   7	0.665	0.513	0.452	0.376	0.279
   8	0.627	0.467	0.404	0.327	0.233
   9	0.592	0.424	0.361	0.284	0.194
   10	0.558	0.386	0.322	0.247	0.162

   Required:

   1a. Compute the cash payback period for each project.

   	Cash Payback Period
   Plant Expansion	1 year 2 years 3 years 4 years 5 years
   Retail Store Expansion	1 year 2 years 3 years 4 years 5 years

   1b. Compute the net present value. Use the present value of $1 table above. If required, round to the nearest dollar.

   	Plant Expansion	Retail Store Expansion
   Total present value of net cash flow	$	$
   Less amount to be invested
   Net present value	$	$

   2. Because of the timing of the receipt of the net cash flows, the

   • plant expansion
   • retail store expansion
   offers a higher
   • net present value
   • net cash flow
   .

1. Cash Payback Period, A method of analysis of proposed capital investments that focuses on the present value of the cash flows expected from the investments.Net Present Value Method, and Analysis

   Elite Apparel Inc. is considering two investment projects. The estimated net cash flows from each project are as follows:

   Year	Plant Expansion		Retail Store Expansion
   1	$149,000		$125,000
   2	122,000		146,000
   3	105,000		100,000
   4	95,000		70,000
   5	30,000		60,000
   Total	$501,000		$501,000

   Each project requires an investment of $271,000. A rate of 15% has been selected for the net present value analysis.

   Present Value of $1 at Compound Interest
   Year	6%	10%	12%	15%	20%
   1	0.943	0.909	0.893	0.870	0.833
   2	0.890	0.826	0.797	0.756	0.694
   3	0.840	0.751	0.712	0.658	0.579
   4	0.792	0.683	0.636	0.572	0.482
   5	0.747	0.621	0.567	0.497	0.402
   6	0.705	0.564	0.507	0.432	0.335
   7	0.665	0.513	0.452	0.376	0.279
   8	0.627	0.467	0.404	0.327	0.233
   9	0.592	0.424	0.361	0.284	0.194
   10	0.558	0.386	0.322	0.247	0.162

   Required:

   1a. Compute the cash payback period for each project.

   	Cash Payback Period
   Plant Expansion	1 year 2 years 3 years 4 years 5 years
   Retail Store Expansion	1 year 2 years 3 years 4 years 5 years

   1b. Compute the net present value. Use the present value of $1 table above. If required, round to the nearest dollar.

   	Plant Expansion	Retail Store Expansion
   Total present value of net cash flow	$	$
   Less amount to be invested
   Net present value	$	$

   2. Because of the timing of the receipt of the net cash flows, the

   • plant expansion
   • retail store expansion
   offers a higher
   • net present value
   • net cash flow

Can you solve and send me the original code which I can copy and paste plz. Thank you.

Kahn's Algorithm

Implement Kahn's Algorithm for giving a topological ordering of a graph as discussed in class. The input graph will be in adjacency list format.

1. Count the in-degree (number of edges ending at) each vertex.

2. Create a queue of nodes with in-degree 0.

3. While the queue is not empty:

a. Add the first element in the queue to the ordering.

b. Decrement the in-degree of each of the first element’s neighbors.

c. Add any neighbors that now have in-degree 0 to the queue.

d. Remove the first element from the queue.

4. If the ordering doesn't contain all nodes then the graph had a cycle and we return None

5. Else we return the ordering

graph = [

[1, 3],

[],

[3, 6, 7],

[6],

[],

[],

[],

[5, 4],

]

order = topological(graph)

print(order)

[0, 2, 1, 3, 7, 6, 4, 5] # one POSSIBLE ordering

order.index(0) < order.index(3)

order.index(0) < order.index(1)

order.index(2) < order.index(3)

order.index(2) < order.index(6)

order.index(2) < order.index(5)

order.index(3) < order.index(6)

order.index(7) < order.index(5)

from collections import deque

#complete following code

def topological(graph):
in_deg = [0 for _ in range(len(graph))]
  
for node1 in range(len(graph)):
for node2 in graph[node1]:
in_deg[node2] += 1
  
queue = deque()
"""
Iterate over all the nodes and append the nodes with in-degree 0 to the queue
"""
# your code here
  
ordereing = []
while len(queue) > 0:
current_node = queue.popleft()
ordereing.append(current_node)

for neighbor in graph[current_node]:
in_deg[neighbor] -= 1
"""
If this neighbor in-degree now becomes 0, we need to append it to the queue
"""

# your code here
  
"""
If we couldn't process all nodes, this means there was a cycle in the graph
and the graph wasn't a DAG.
"""
if len(ordereing) != len(graph):
return None
  
return ordereing

order.index(7) < order.index(4)

Tombro Industries is in the process of automating one of its plants and developing a flexible manufacturing system. The company is finding it necessary to make many changes in operating procedures. Progress has been slow, particularly in trying to develop new performance measures for the factory.

In an effort to evaluate performance and determine where improvements can be made, management has gathered the following data relating to activities over the last four months:

The president has read in industry journals that throughput time, MCE, and delivery cycle time are important measures of performance, but no one is sure how they are computed. You have been asked to assist the company, and you have gathered the following data relating to these measures:

3-a. Refer to the inspection time, process time, and so forth, given for month 4. Assume that in month 5 the inspection time, process time, and so forth, are the same as for month 4, except that the company is able to completely eliminate the queue time during production using Lean Production. Compute the new throughput time and MCE. (Round your answers to 1 decimal place.)

3-b. Refer to the move time, process time, and so forth, given for month 4. Assume that in month 6 the inspection time, process time, and so forth, are the same as in month 4, except that the company is able to eliminate both the queue time during production and the inspection time using Lean Production. Compute the new throughput time and MCE.. (Round your answers to 1 decimal place.)

Please solve this problem with Python Language.

P#2. A Pythagorean triplet is a set of three natural numbers, a < b < c, for which a2 + b2 = c2 . For example, 32 + 42 = 52. And a + b + c = 3 + 4 + 5 = 12. There exists exactly two Pythagorean triplet for which a + b + c = 300. Find a, b, c.

Hints: Level-0 Algorithm:

1. Find the possible ranges of a and b for which a+b+c is around 300 (include the paper & pencil analysis at the end of your report)

2. Compute c for each combination of a and b

3. Verify if ?+?+?=300 and ?2+?2=?2 and ?<?<?

4. Print results

I really don't understand to do this problem.

Your code must print all the steps in the output as an Eg>

When you run your Merge sort code the sequence of output should be:

1) Enter input sequence

2) Show n/2 division of the input sequence

3) keep showing n/2 division of your sequence until you get one attribute

4) Sort first two numbers

5) Make a stack of 4 by merging 2 * 2 and sort them

6) keep showing merging and sorting until you show the final merging of last two stacks and sort them.

Similarly, show all the steps for Bubble sort.

Mostly need Bubble in Java, please.v

Please code in python or C++

Misty is fond of pokemons and likes to collect pokemon cards. She has P pokemon cards with her at present. She wants to have a particular number of cards on the Dth day. Her friend Ash is ready to help her to achieve the number. Ash will provide her N cards daily so that a day before the Dth day, she will have the required number of Pokemon cards.

Example:

Misty has cards with her, P = 5

D = 6

Ash will provide her with cards daily, N = 4

Ash provides pokemon cards:

Day 1 = 4

Day 2 = 4

Day 3 = 4

Day 4 = 4

Day 5 = 4

Total cards Ash provides = 4 + 4 + 4 + 4 + 4 = 20

Total number of pokemon cards Misty has on the Dth day = 5 + 20 = 25

Misty is busy with her tournament and wants to know the total number of pokemon cards she will have on Dth day. Can you tell her?

Input Format

The first line of input consists of the number of test cases, T

The only line of each test case consists of three space-separated integers, P, N and D.

Constraints

1<= T <=100

1<= D <=100000

0 <= P, N <=100000