Jack is the only shareholder of XYZ Corporation. At year-end, XYZ had $200 of current year earnings and profits and $600 of accumulated earnings and profits. If XYZ distributes cash of $200 to Jack, what is Jack’s tax liability on the dividend, if any? Assume Jack has a basis of $10 in XYZ shares. How does this result change if XYZ only has $50 of current earnings and profits and $100 of accumulated earnings and profits?

Clearly identify the requirements being addressed. Show all calculations within the cells of an Excel spreadsheet. This means that you must use formulas and links so that the thought process can be examined. Make effective use of comments to convey your thought process as well. No hard coding of solutions. Submit a single MS Excel file for grading.

An asset used in a 4-year project falls in the 5-year MACRS class (refer to MACRS table on page 277), for tax purposes. The asset has an acquisition cost of $22,437,430 and will be sold for $5,064,805 at the end of the project. If the tax rate is 0.39, what is the aftertax salvage value of the asset (SVNOT)?

Colsen Communications is trying to estimate the first-year net operating cash flow (at Year 1) for a proposed project. The financial staff has collected the following information on the project:

The company has a 40% tax rate, and its WACC is 14%.

Write out your answers completely. For example, 13 million should be entered as 13,000,000.

1. What is the project's operating cash flow for the first year (t = 1)? Round your answer to the nearest dollar.
   $  
2. 
   
3. If this project would cannibalize other projects by $2.5 million of cash flow before taxes per year, how would this change your answer to part a? Round your answer to the nearest dollar.
   The firm's OCF would now be $  
4. 
   
5. Ignore Part b. If the tax rate dropped to 35%, how would that change your answer to part a? Round your answer to the nearest dollar.
   The firm's operating cash flow would -Select-increasedecreaseItem 3 by $  

Create a concrete LinkedList class that extends the provided ALinkedList class. You will need to override the extract()method in your class. You can use your main() method for testing your method (although you do not need to provide a main method).

Recall that a list is an ordered collection of data

X_0, X_1, X_2, ..., X_n-1

The extract(int start, int end) method removes all elements

X_start, X_start_1, ..., X_end-1

from the list. It also returns all removed elements as a new list (LinkedList) that retains the same ordering.

For example, if the initial list called animals was

cat, dog, eel, cow, owl, pig, pip

then animals.extract(1,5) would return the new list

dog, eel, cow, owl

and animals would now be the list

cat, pig, pip

The AlinkedList class also has a sort() method that currently does nothing. Complete this method so that it sorts the current linked list (alphabetically).

For example, if there was a list called kids that consisted of

puppy, kitten, cub, leveret, kit, cygnet

then after calling kids.sort(), the list would now be

cub, cygnet, kit, kitten, leveret, puppy

This is the code:

public abstract class ALinkedList{

    public Node head;

    public Node tail;

    public int size;

    /** removes and returns the sublist

        * [x_start, x_start+1, ..., x_end-1] from the current list

        *

        * @param start is the starting position of the list to remove.

        * You can assume that 0 <= start <= length of list -1.

        * @param end is position after the last element to be removed.

        * You can assume that start <= end <= length of list.

        */

    public abstract ALinkedList extract(int start, int end);

    /** Sorts this list

     <p>

     This method sorts this list lexicographically (alphabetically).

     Use the built-in compareTo() in the String class to compare individual

     strings in the list.

     <p>

     You are NOT allowed to use any sort method provided in java.util.Arrays

     or java.util.Collections.

     */

    public void sort(){}

    /* -----------------------------------------

     provided code

         ----------------------------------------- */

        /** returns the size of the list

        *

        * @return the size of the list

        */

    public final int size(){ return size; }

    public final String get(int position){

        // returns data of element at index position

        // returns null otherwise

        if( position < 0 || position > size -1 || head == null){

            return null;

        }

        int count = 0;

        Node current = head;

        while(count < position){

            current = current.getNext();

            count += 1;

        }

        return current.get();

    }

    /** add a string to the back of the list

     *

     * @param s is a string to add to the back of the list

     * @return the current list

     */

    public final ALinkedList add(String s){

        if( size == 0 ){

            head = tail = new Node(s, null);

        }else{

            Node tmp = new Node(s, null);

            tail.setNext(tmp);

            tail = tmp;

        }

        size += 1;

        return this;

    }

    public final ALinkedList add(int position, String d){

        // add a new node with data d at given position

        // return null if method fails

        if( position < 0 || position > size){

            return null;

        }

        if( position == 0){

            return addFront(d);

        }else if( position == size ){

            return add(d);

        }

        // find node at index position-1

        Node prev = head;

        int count = 0;

        while( count < position-1 ){

            count += 1;

            prev = prev.getNext();

        } // prev will point to node before

        Node n = new Node(d, prev.getNext() );

        prev.setNext(n);

        size += 1;

        return this;

    }

    /* remove from the back */

    public final String remove(){

        if( tail == null || size == 0 ){ return null; }

        String s = tail.get();

        if( size == 1){

            head = tail = null;

        }else{

            Node tmp = head;

            for(int i=0; i<size-2; i+=1){

                tmp = tmp.getNext();

            } // at end of loop tmp.getNext() == tail is true

            tail = tmp;

            tail.setNext(null);

        }

        size -= 1;

        return s;

    }

    /* remove first string in list */

    public final String removeFront(){

        if(head == null || size == 0){return null;}

        String s = head.get();

        if(size == 1){

            head = tail = null;

        }else{

            Node tmp = head;

            head = tmp.getNext();

            tmp.setNext(null);

        }

        size -= 1;

        return s;

    }

    /* add string to front of list */

    public final ALinkedList addFront(String s){

        if(size == 0){

            head = tail = new Node(s, null);

        }else{

            head = new Node(s, head);

        }

        size += 1;

        return this;

    }

    /* string representation of list */

    @Override

    public final String toString(){

        String s = "[";

        Node tmp = head;

        for(int i=0; i<size-1; i++){

            s += tmp.get() + ", ";

            tmp = tmp.getNext();

        }

        if(size > 0){

            s += tmp.get();

        }

        s += "]";

        return s;

    }

}