All successful collaborations aim to achieve collaborative advantage. This, however, is not easily realised. Based on the course material, and using examples from your professional or personal life:

• Discuss the bases for achieving collaborative advantage;
• Discuss the types of goals that need to be set to achieve collaboration aims;
• Outline when these goals might lead to collaborative inertia and identify which might lead to harmful outcomes. (600 words)

Part E (3 marks):  What is the shape of a BST that is O(n) to delete the root?  Draw an example with at least 8 nodes.

Narelle borrows $600,000 on a 25-year property loan at 4 percent per annum compounding monthly. The loan provides for interest-only payments for 5 years and then reverts to principal and interest repayments sufficient to repay the loan within the original 25-year period. Assume rates do not change.

a) Calculate the monthly repayment for the first 5 years. (CLUE: it is INTEREST ONLY)

b) Calculate the new monthly repayment after 5 years assuming the interest rate does not change. (You need the repayment required to amortise the loan to $0 in remaining 20 years)

c) Calculate the total repayments over the life of the loan.

d) Has she paid more or less than she would have if she took a principal and interest loan at the outset? Demonstrate showing your workings.

e) Why might she choose interest-only loan terms?

PLEASE EXPLAIN ANSWER WITHOUT CALCULATING FROM EXCEL

How is it possible that dividends are so important, but, at the same time, dividend policy is irrelevant? Without taxes or any other imperfections, why doesn’t it matter how the firm distributes cash?

Using python programming language, compare the four tasks.

1. For the following exercises you will be writing a program that implements Euler’s method (pronounced ‘oy-ler’). It may be the case that you have not yet encountered Euler’s method in the course. Euler’s method can be found in Chapter 10.2 of your notes, which gives a good description of why this algorithm works. But for our purposes, we only need to know the algorithm itself - so there’s no need to worry if you are yet to understand it.

Euler’s method is used to approximate a function when only the derivative and a particular value is known. Given an initial value y and a corresponding x value, a derivative f’(x), and a step size h, the next value for y is calculated using the following formula:

next y = current y + f'(x)*h

If you want to calculate more steps, just reuse the formula but with your new y value. The new x value is also updated to x+h.

Task: To start, write a function called fdash(x), that returns the value of the derivative at x. The formula for the derivative which we will be using as a placeholder is:

fdash = 0.05x * e^(0.05x)

Round the output to 5 decimal places. Do not print anything, call your function, or ask for any input.

2. Recall the formula for Euler’s method is:

next y = current y + f'(x)*h

Task: Write a function called onestep(x, y, h) that calculates the next y value using Euler’s method with the given x, y and h values. The derivative is the same as used in the previous exercise. Copy paste your function from the previous exercise and use it in your onestep function.

Round the output to 5 decimal places. Do not print anything, call your onestep function, or ask for any input. You should have two functions defined in your code (onestep and fdash).

3. Recall that after one step of Euler’s function is calculated, the new x value is also updated to x+h. Note that it happens in that orde.r First the next y value is found, then the corresponding x value is updated.

Task: Write a function called eulers(x, y, h, n) that uses euler’s method n times with the given x, y and h values. It will return the final y value. Remember to copy paste your onestep and fdash functions. You are encouraged to use them in your eulers function, but it is up to you.

The fdash and onestep functions already round their output, so you will not need to do any rounding inside the eulers function.

Hint: One way of implementing this function is to use a while loop.

If you need help with Euler’s method:

The following example of Euler’s method is given in case you do not understand how it works with multiple steps:

F dash: 2x + 2

Initial x: 1

Initial y: 4

Step size (h): 0.5

Number of steps (n): 3

Step 1:

Fdash = 2*1 + 2 = 2 + 2 = 4

Value of y at step 1: new y = 4 + 4*0.5 = 4 + 2 = 6

New x value = 1 + 0.5 = 1.5

Step 2:

Fdash = 2*1.5 + 2 = 3 + 2 = 5

Value of y at step 2: new y = 6 + 5*0.5 = 6 + 2.5 = 8.5

New x value = 1.5 + 0.5 = 2

Step 3:

Fdash = 2*2 + 2 = 4 + 2 = 6

Value of y at step 3: new y = 8.5 + 6*0.5 = 8.5 + 3 = 11.5

New x value = 2 + 0.5 = 2.5

So our final value for y is 11.5 after 3 steps (at x = 2.5). For interest, one function with this derivative is y = x**2+2*x+1. At x = 1, y is equal to 4, like in this example. At x = 2.5 (which is our final x value), the value of y is 12.25. This is pretty close to our approximated value of 11.5.

4. An asteroid has been spotted travelling through our solar system. One astrophysicist has predicted that it will collide with Earth in exactly 215 days, using a new method for modelling trajectories. The researcher has asked you and others to verify their claim using a variety of methods. You have been tasked with modelling the asteroid’s trajectory using Euler’s method.

For an asteroid to collide with Earth, it needs to have the same x, y, and z coordinates as the Earth in 215 days (x, y, and z represent the three dimensions. Because solar systems are three dimensional!). If any of the final predicted x, y, and z values are different to the Earth’s, then that will mean the asteroid will not collide with Earth in 215 days.

It has already been proven that the asteroid will have the same x and z coordinates as Earth in 215 days. So, you only need to worry about the y dimension.

The equation for the change in y at day t after the asteroid was discovered is:

y'(t) = (-0.05t+5)*exp(0.002t)*0.05

In other words, this equation is the derivative of y(t). The starting y position of the asteroid is 160.195 million kilometers, which occurs at t = 0. The y position of Earth in 215 days (t = 215) is 150 million kilometers.

Task: Write a function called will_it_hit(h), that returns the number 1 if the asteroid is going to hit Earth in 215 days, and 0 otherwise - along with the Euler’s method prediction of the asteroid’s y poistion.

The Earth will be considered ‘hit’ if the asteroid gets within 0.01 million kilometers of Earth (so abs(earthy - asteroidy)<=0.1). The input for the function is h, which indicates the step size in days. So h = 0.5 indicates that there are two steps of Euler’s method per day, resulting in 215/0.5 = 530 steps of Euler’s method.

As with the previous exercises, the output for the fdash and onestep functions should be rounded to 5 decimal places.

Use your code from the previous exercises. The only thing you will need to change is fdash. We have written tests for each of your functions (fdash, onestep, eulers, will_it_hit), to help you understand where errors might be. Good luck!

Note: All units for the y location of the asteroid should be in millions of kilometers. For example, will_it_hit(5) should give output (0, 151.72445).

Consider the following bonds currently traded in the market. Using this information find the no-arbitrage price of a 5-Year bond with a coupon of 5%. Suppose this bond is currently selling for $102 in the market. Is there an arbitrage opportunity? Explain how you would execute this arbitrage (All coupons are annual payment, including the bond you are asked to price)

how would you convert potassium oleate soap to the corresponding fatty acid?

how to write a financial analysis and recommendation in real estate investment?

please do it in C++, will up vote!! please add snap shots of result and explanation.

You are to create a recursive function to perform a linear search through an array.

How Program Works

Program has array size of 5000

Load values into the array, equal to its index value. Index 5 has value 5, index 123 has value 123.

Pass array, key, and size to the recursive function:

int recursiveLinearSearch(int array[],int key, const int size, bool & methodStatus)

User enters key to search for, recursive function calls itself until the key is found (methodStatus is true), print out the key and number of function calls when control is returned to the main

Handle situation of key not found (return number of function calls AND methodStatus of false) – print not found message and number of calls in the main

Function returns a count of how many recursive calls were made

Value returned is the number of calls made to that point, that is, when item is found the value returned is 1 with preceding functions adding 1 to the return value until the actual number of recursive function calls are counted).

Determine smallest key value that causes stack-overflow to occur, even if you need to make array larger than 5000.

Test cases need to include, biggest possible key value, “not found” message, and a stack overflow condition.

2.The importance of taking inventory in both perpetual and periodic inventory systems (mention some control mechanisms)

Mesa Blanca decides to invest $5 million in Action Technologies. Expected exit valuation is $125 million and time to exit is 5 years. Mesa Blanca wants a 50% / year return and expects future dilution of 60%.

What might lead Mesa Blanca to expect future dilution of 60%?

What would the pre and post money valuation, and % ownership Mesa Blanca require at the time of their investment?

What does this analysis suggest about Action Technologies?