Two cars are approaching each other, one traveling north with a momentum of 3 kg-m/s and one traveling east with a momentum of 4 kg-m/s. The two cars collide and stick together. Right after the collision (choose all that apply)

1. the eastern component of the momentum of the two cars is 4 kg-m/s.

2. the northern component of the momentum of the two cars is 3 kg-m/s.

3. the total momentum of the two cars is 7 kg-m/s

1. Needs to use SPSS to compute these things.
2. Insomnia has become an epidemic in the United States. Much research has been done in the development of new pharmaceuticals to aide those who suffer from insomnia. Alternatives to the pharmaceuticals are being sought by sufferers. A new relaxation technique has been tested to see if it is effective in treating the disorder. Sixty insomnia sufferers between the ages of 18 to 40 with no underlying health conditions volunteered to participate in a clinical trial. They were randomly assigned to either receive the relaxation treatment or a proven pharmaceutical treatment. Thirty were assigned to each group. The amount of time it took each of them to fall asleep was measured and recorded. The data is shown below. Run an independent samples t-test to determine if the relaxation treatment is more effective than the pharmaceutical treatment at a level of significance of 0.05. Report the test statistic using correct APA formatting and interpret the results.

1. Insomnia has become an epidemic in the United States. Much research has been done in the development of new pharmaceuticals to aide those who suffer from insomnia. Alternatives to the pharmaceuticals are being sought by sufferers. A new relaxation technique has been tested to see if it is effective in treating the disorder. Sixty insomnia sufferers between the ages of 18 to 40 with no underlying health conditions volunteered to participate in a clinical trial. They were randomly assigned to either receive the relaxation treatment or a proven pharmaceutical treatment. Thirty were assigned to each group. The amount of time it took each of them to fall asleep was measured and recorded. The data is shown below. Run an independent samples t-test to determine if the relaxation treatment is more effective than the pharmaceutical treatment at a level of significance of 0.05. Report the test statistic using correct APA formatting and interpret the results.

****PLEASE HELP WALK ME THROUGH SPSS, I HAVE BEEN STUCK ON THIS PROBLEM FOR DAYS! ****

1. Insomnia has become an epidemic in the United States. Much research has been done in the development of new pharmaceuticals to aide those who suffer from insomnia. Alternatives to the pharmaceuticals are being sought by sufferers. A new relaxation technique has been tested to see if it is effective in treating the disorder. Sixty insomnia sufferers between the ages of 18 to 40 with no underlying health conditions volunteered to participate in a clinical trial. They were randomly assigned to either receive the relaxation treatment or a proven pharmaceutical treatment. Thirty were assigned to each group. The amount of time it took each of them to fall asleep was measured and recorded. The data is shown below. Run an independent samples t-test to determine if the relaxation treatment is more effective than the pharmaceutical treatment at a level of significance of 0.05. copy and paste the chart from SPSS. Report the test statistic using correct APA formatting and interpret the results.

Blurred Sequence

Jojo as a treasure hunter has finally found the ancient treasure box. The treasure box has three layers of lock. Each layer of lock contains clues to unlock the lock.

The first layer of lock gives a sequence of numbers. But as we know that the treasure box is as old as the dinosaurs, the sequence is blurred as it goes to the end. Jojo can only read the first seven numbers of the sequence which is: 1 , 1 , 2 , 3 , 5 , 8 , 13, ... and the rest are blurred.

After a days of researching, Jojo found out that the sequence is a fibonacci sequence which each number is the sum of the two preceding ones. Formally, fibonacci sequence are written as F_i as the _i-th fibonacci number and its property is F_i = F_i-1 + F_i-2 where i > 2 and in this case, the base cases are F1 = 1 and F₂ = 1.

And it’s not even the riddle yet. The lock gives Jojo two numbers L and R and asks Jojo to get the sum of its digits from L-th fibonacci to R-th fibonacci inclusive. As a good friend of Jojo, help Jojo to solve the first layer lock riddle.

Format Input:

There are T testcases. Each testcase contains two integers L and R which indicates the numbers that the lock gives.

Format Output:

Output T line with format “Case # X: ”, where X indicates the testcase number and then followed by the answer of the riddle.

Constraints

• 1 ≤ T ≤ 100

• 1 ≤ L ≤ R ≤ 64

Sample Input (standard input):

5

1 4

3 5

6 7

9 9

3 11

Sample Output (standard output):

Case #1: 7

Case #2: 10

Case #3: 12

Case #4: 7

Case #5: 59

NOTE: USE C LANGUAGE, DONT USE FUNCTION(RESULT,RETURN),VOID,RECURSIVE, USE BASIC CODE AND CODE IT UNDER int main (){, constraint must be the same

Using a sample of 50 quarters of inflation data, you carry out an AR(2) model regression, and produce the following results:

The two most recent quarterly annualized inflation observations in your data are 2.03 (second to last observation) and 2.18 (latest observation).

Based on these results, what is your prediction for the rate of inflation at time 52 (two quarters in the future from your latest observation)?

Please show on excel.

The answer is 2.3

Orchard Relief is a product that is designed to improve sleep at night. The company, Eli Orchard, is guessing that sales of the product is somewhat related to sleeping patterns of customers over the days of the week. Before mass production of the product, Eli Orchid has market-tested Orchid Relief in only Orange County over the past 8 weeks. The weekly demand is recorded. Eli Orchid is now trying to use the sales pattern over the past 8 weeks to predict sales in US for the upcoming few weeks, especially for days 57 and 60. An accurate forecast would be helpful in arrangements for the company’s production processes and design of price promotions over each week.

Using the regression method on the de-seasonalized time series, what is a de-seasonalized forecast for day 60?

Orchard Relief is a product that is designed to improve sleep at night. The company, Eli Orchard, is guessing that sales of the product is somewhat related to sleeping patterns of customers over the days of the week. Before mass production of the product, Eli Orchid has market-tested Orchid Relief in only Orange County over the past 8 weeks. The weekly demand is recorded. Eli Orchid is now trying to use the sales pattern over the past 8 weeks to predict sales in US for the upcoming few weeks, especially for days 57 and 60. An accurate forecast would be helpful in arrangements for the company’s production processes and design of price promotions over each week.

What is the MAD using the exponential smoothing constant of 0.7?

Implement a priority queue using a DoublyLinkedList where the node with the highest priority (key) is the right-most node.
The remove (de-queue) operation returns the node with the highest priority (key).
If displayForward() displays List (first-->last) : 10 30 40 55
remove() would return the node with key 55.
Demonstrate by inserting keys at random, displayForward(), call remove then displayForward() again.

You will then attach a modified DoublyLinkedList.java (to contain the new priorityInsert(long key) and priorityRemove() methods).

Use the provided PQDoublyLinkedTest.java to test your code.

I cant get PQDoublyLinkedTest to work with my code. I already got the rest of code working. Please comment if you want me to add the rest of the code.

PLEASE DO NOT MODIFY PQDoublyLinkedTest!!! its just for testing the code.

public class PQDoublyLinkedTest
{
public static void main(String[] args)
{ // make a new list
DoublyLinkedList theList = new DoublyLinkedList();

theList.priorityInsert(22); // insert at front
theList.priorityInsert(44);
theList.priorityInsert(66);

theList.priorityInsert(11); // insert at rear
theList.priorityInsert(33);
theList.priorityInsert(55);
  
theList.priorityInsert(10);
theList.priorityInsert(70);
theList.priorityInsert(30);

theList.displayForward(); // display list forward
Link2 removed = theList.priorityRemove();
System.out.print("priorityRemove() returned node with key: ");
removed.displayLink2();
  
} // end main()
} // end class PQDoublyLinkedTest

public class DoublyLinkedList
{
private Link first; // ref to first item
private Link last; // ref to last item
public DoublyLinkedList() // constructor
{
first = null; // no items on list yet
last = null;
}

public boolean isEmpty() // true if no links
{
return first == null;
}

public void insertFirst(long dd) // insert at front of list
{
Link newLink = new Link(dd); // make new link
if (isEmpty()) // if empty list,
last = newLink; // newLink <-- last
else
first.previous = newLink; // newLink <-- old first
newLink.next = first; // newLink --> old first
first = newLink; // first --> newLink
}

public void insertLast(long dd) // insert at end of list
{
Link newLink = new Link(dd); // make new link
if (isEmpty()) // if empty list,
first = newLink; // first --> newLink
else {
last.next = newLink; // old last --> newLink
newLink.previous = last; // old last <-- newLink
}
last = newLink; // newLink <-- last
}

public Link deleteFirst() // delete first link
{ // (assumes non-empty list)
Link temp = first;
if (first.next == null) // if only one item
last = null; // null <-- last
else
first.next.previous = null; // null <-- old next
first = first.next; // first --> old next
return temp;
}

public Link deleteLast() // delete last link
{ // (assumes non-empty list)
Link temp = last;
if (first.next == null) // if only one item
first = null; // first --> null
else
last.previous.next = null; // old previous --> null
last = last.previous; // old previous <-- last
return temp;
}
// insert dd just after key

public boolean insertAfter(long key, long dd)
{ // (assumes non-empty list)
Link current = first; // start at beginning
while (current.dData != key) // until match is found,
{
current = current.next; // move to next link
if (current == null)

return false; // didn't find it
}
Link newLink = new Link(dd); // make new link

if (current == last) // if last link,
{
newLink.next = null; // newLink --> null
last = newLink; // newLink <-- last
} else // not last link,

{
newLink.next = current.next; // newLink --> old next
// newLink <-- old next
current.next.previous = newLink;
}
newLink.previous = current; // old current <-- newLink
current.next = newLink; // old current --> newLink
return true; // found it, did insertion

}

public Link deleteKey(long key) // delete item w/ given key
{ // (assumes non-empty list)
Link current = first; // start at beginning
while (current.dData != key) // until match is found,
{
current = current.next; // move to next link
if (current == null)
return null; // didn't find it
}

if (current == first) // found it; first item?
first = current.next; // first --> old next
else
// not first
// old previous --> old next
current.previous.next = current.next;

if (current == last) // last item?
last = current.previous; // old previous <-- last
else
// not last
// old previous <-- old next
current.next.previous = current.previous;
return current; // return value
}

public void displayForward()
{
System.out.print("List (first-->last): ");
Link current = first; // start at beginning
while (current != null) // until end of list,
{
current.displayLink(); // display data
current = current.next; // move to next link
}
System.out.println("");
}

public void displayBackward()
{
System.out.print("List (last-->first): ");
Link current = last; // start at end
while (current != null) // until start of list,
{
current.displayLink(); // display data
current = current.previous; // move to previous link
}
System.out.println("");
}

public void insertSorted(long key)
{
// if list is empty or key is less than current first, inserting at
// first
if (isEmpty() || key < first.dData) {
insertFirst(key);
return; // exiting method
}
// taking a reference to first
Link current = first;
// looping as long as current.next is not null
while (current.next != null) {
// checking if key can be added between current and current.next
if (key >= current.dData && key <= current.next.dData) {
// adding between current and current.next and updating all
// links
Link lnk = new Link(key);
lnk.next = current.next;
current.next.previous = lnk;
current.next = lnk;
lnk.previous = current;
return; //exiting
}
//otherwise, advancing to next link
current = current.next;
}
//if the element is still not inserted, adding to the end
insertLast(key);
}
} // end class DoublyLinkedList

class Link
{
public long dData; // data item
public Link next; // next link in list
public Link previous; // previous link in list
public Link(long d) // constructor
{
dData = d;
}

public void displayLink() // display this link
{
System.out.print(dData + " ");
}
} // end class Link

A company wants to study the relationship between an employee's length of employment and their number of workdays absent. The company collected the following information on a random sample of seven employees.

1. What is the independent variable (X)?

2. What is the dependent variable (Y)?

3. What is the slope of the linear equation?

4. What is the Y intercept of the linear equation?

5.What is the least squares equation for the data?

6.What is the meaning of a negative slope?

7.What is the standard error of estimate?