Marin Inc. has an executive stock option plan, details of which follow:

Marin uses an option-pricing model to value the stock options. When granted, the options are estimated to have a fair value of $8.50 each. This estimate remains unchanged during the vesting period.

Assuming that Marin has a December 31 year end, prepare the required journal entries as at the following dates. (Credit account titles are automatically indented when the amount is entered. Do not indent manually. If no entry is required, select "No Entry" for the account titles and enter 0 for the amounts.)

Assuming that Marin has a December 31 year end, prepare the required journal entries as at the following dates. (Credit account titles are automatically indented when the amount is entered. Do not indent manually. If no entry is required, select "No Entry" for the account titles and enter 0 for the amounts.)

1. Determine each of the following set of vectors is linearly independent or dependent.

(a) S1 = {(1, 2, 3),(4, 5, 6),(6, 9, 12)}.

(b) S2 = {(1, 2, 3, 4),(5, 6, 7, 8),(3, 2, 1, 0)}.

(c) S3 = {(1, 2, 3, 4),(5, 6, 7, 8),(9, 10, 11, 12)}

A researcher is interested to learn if there is a relationship between the level of interaction a women in her 20s has with her mother and her life satisfaction ranking. Below is a list of women who fit into each of four level of interaction. Conduct a One-Way ANOVA on the data to determine if a relationship exists. State whether or not a relationship exists and why or why not. Explain in as much detail as possible.

Recently, California has pushed for a new ethnic studies graduation requirement for high schoolers and students of the California State University system, AB 331. A sociologist suggests support for the proposed legislation is largely divided by racial groups. The following data table shows support for AB 331 based on the 5 racial groups designated by the U.S. Census. The scale is 1 to 7 where 1 represents no support and 7 represents complete support ----ANOVA method---

Given a square matrix of integers m, your task is to rearrange its numbers in the following way:

• First, sort its values in ascending order of how frequently the number occurs in m. In the case of a tie, sort the equally frequent numbers by their values, in ascending order.
• Second, place the sorted numbers diagonally, starting from the bottom right corner, like this:

Example

For

m = [[ 1, 4, -2],
     [-2, 3,  4],
     [ 3, 1,  3]]

the output should be

sortMatrixByOccurrences(m) = [[3,  3,  4],
                              [3,  4,  1],
                              [1, -2, -2]]

• First we look at the frequency of each number:

  • Number 1 occurs 2 times;
  • Number -2 occurs 2 times;
  • Number 3 occurs 3 times;
  • Number 4 occurs 2 times.

  Because numbers 1, -2, and 4 occur the same number of times, we sort them by their values in ascending order. Number 3 occurs the most numbers of times, so it goes after all other numbers. Finally, after sorting we get the following array: [-2, -2, 1, 1, 4, 4, 3, 3, 3]

• After sorting, the numbers should be placed diagonally starting from the bottom right corner, as follows:

  [[3,  3,  4],
   [3,  4,  1],
   [1, -2, -2]]
  

Input/Output

• [execution time limit] 0.5 seconds (cpp)

• [input] array.array.integer m

  A square matrix of integers.

  Guaranteed constraints:
  1 ≤ m.length ≤ 40,
  m[i].length = m.length,
  -1000 ≤ m[i][j] ≤ 1000.

• [output] array.array.integer

  • The matrix m rearranged according to the specifications above.

code given:

std::vector> sortMatrixByOccurrences(std::vector> m) {

}

A study investigated the relationship between audit delay (Delay), the length of time from a company's fiscal year-end to the date of the auditor's report, and variables that describe the client and the auditor. The independent variables are as follows.

Industry A dummy variable coded 1 if the firm was an industrial company or 0 if the firm was a bank, savings and loan, or insurance company.

Public A dummy variable coded 1 if the company was traded on an organized exchange or over the counter; otherwise coded 0.

Quality A measure of overall quality of internal controls, as judged by the auditor, on a five-point scale ranging from "virtually none" (1) to "excellent" (5).

Finished A measure ranging from 1 to 4, as judged by the auditor, where 1 indicates "all work performed subsequent to year-end" and 4 indicates "most work performed prior to year-end."

A sample of 40 companies provided the following data.

Enter negative values as negative, if necessary.

a. Develop the estimated regression equation using all four independent variables (to 3 decimals, if necessary). Delay = -------- + -------- Industry + ------- Public + ------- Quality + -----------Finished .

b. What is the value of the coefficient of determination (to 3 decimals)? Note: report R 2 between 0 and 1.

Did the estimated regression equation in part (a) provide a good fit?

c. Which of the following is a scatter diagram for showing Delay as a function of Finished? What does this scatter diagram indicate about the relationship between Delay and Finished?

The scatter diagram of Delay and Finishing suggests exists between these two variables. Add Finished-Squared as a fifth independent variable. Use best subsets regression procedure to answer the following question.

Which independent variables provide the best regression model if two independent variables are in the model?

Which independent variables provides the best regression model if three independent variables are in the model?

d. Using the best subset regression procedure, how many independent variables are in the highest adjusted R 2 model?

What is the value of R 2(adj) (to 1 decimal)? Note: report R 2(adj) as a percentage.

------------%

Write a C++ or Java program that reads an input graph data from a user. Then, it should present a path for the travelling salesman problem (TSP). In the assignment, you can assume that the maximum number ofvertices in the input graph is less than or equal to 20.

Input format: This is a sample input from a user.

The first line (= 4 in the example) indicates that there are four vertices in the graph. The next line (= 12 in the example) indicates the number of edges in the graph. The remaining 12 lines are the edge information with the “source vertex”, “destination vertex”, and “cost”. The last line (= 0 in the example) indicates the starting vertex of the travelling salesman problem. This is the graph with the input information provided.

Sample Run 0: Assume that the user typed the following lines

4

12

0 1 2

0 3 7

0 2 5

1 0 2

1 2 8

1 3 3

2 0 5

2 1 8

2 3 1

3 0 7

3 1 9

3 2 1

0

This is the correct output. Your program should present the path and total cost in separate lines.

Path:0->1->3->2->0

Cost:11

Sample Run 1: Assume that the user typed the following lines

5

6

0 2 7

3 1 20

0 4 3

1 0 8

2 4 100

3 0 19

3

This is the correct output.

Path:

Cost:-1

Note that if there is no path for the TSP, your program should present empty path and -1 cost.

Sample Run 2: Assume that the user typed the following lines

5

7

0 2 8

2 1 7

2 4 3

1 4 100

3 0 20

3 2 19

4 3 50

3

This is the correct output of your program.

Path:3->0->2->1->4->3

Cost:185

This is the directed graph of the input data:

[Hint]: To solve this problem, you can use all permutations of the vertices, except the starting vertex. For example, there are three vertices 1, 2, and 3, in the first sample run, except the starting vertex 0. This is all permutations with the three vertices

            1, 2, 3

            1, 3, 2

            2, 1, 3,

            2, 3, 1

            3, 1, 2

            3, 2, 1

Write a Java program that reads an input graph data from a user. Then, it should present a path for the travelling salesman problem (TSP). In the assignment, you can assume that the maximum number of vertices in the input graph is less than or equal to 20.

Input format: This is a sample input from a user.

The first line (= 4 in the example) indicates that there are four vertices in the graph. The next line (= 12 in the example) indicates the number of edges in the graph. The remaining 12 lines are the edge information with the “source vertex”, “destination vertex”, and “cost”. The last line (= 0 in the example) indicates the starting vertex of the travelling salesman problem. This is the graph with the input information provided.

Sample Run 0: Assume that the user typed the following lines

4

12

0 1 2

0 3 7

0 2 5

1 0 2

1 2 8

1 3 3

2 0 5

2 1 8

2 3 1

3 0 7

3 1 9

3 2 1

0

This is the correct output. Your program should present the path and total cost in separate lines.

Path:0->1->3->2->0

Cost:11

Sample Run 1: Assume that the user typed the following lines

5

6

0 2 7

3 1 20

0 4 3

1 0 8

2 4 100

3 0 19

3

This is the correct output.

Path:

Cost:-1

Note that if there is no path for the TSP, your program should present empty path and -1 cost.

Sample Run 2: Assume that the user typed the following lines

5

7

0 2 8

2 1 7

2 4 3

1 4 100

3 0 20

3 2 19

4 3 50

3

This is the correct output of your program.

Path:3->0->2->1->4->3

Cost:185

This is the directed graph of the input data:

[Hint]: To solve this problem, you can use all permutations of the vertices, except the starting vertex. For example, there are three vertices 1, 2, and 3, in the first sample run, except the starting vertex 0. This is all permutations with the three vertices

            1, 2, 3

            1, 3, 2

            2, 1, 3,

            2, 3, 1

            3, 1, 2

            3, 2, 1

Consider the following Markov chain with P{X0 = 2} = 0.6 and P{X0 = 4} = 0.4:

1 2 3 4 5 6

1 0 0 0 0 1 0

2 .2 .05 0 .6 0 .15

3 0 0 .8 0 0 .2

4 0 .6 0 .2 0 .2

5 1 0 0 0 0 0

6 0 0 .7 0 0 .3

a. What is P{X1 = 4, X2 = 6 | X0 = 2}?

b. What is P{X2 = 6 | X0 = 2}? What is P{X18 = 6 | X16 = 2}?

c. What is P{X0 = 2, X1 = 4, X2 = 6}?

d. What is P{X1 = 4, X2 = 6}?

Question 2:

Download the Excel data file "Arlington_Homes" from the folder "Data" under "Chapter 12."

a) read the data file in R.

b) using R, answer question 65 (a, b, and c) on page 411 of your book. Run the regression, show the estimates and test. Write what you are testing using a comment in the R program.

Question #65. link for page 411 #65 https://imgur.com/s0SgxP3

please show every step for R frmulas