Write a recursive method that prints the binary form of a given non-negative integer, with the following specification:

public class NPrint { public static void binaryPrint(int n) { // your implementation } } 

The method prints the value of n as a BINARY number. If n is zero, then a single zero is printed; otherwise no leading zeros are printed in the output. Examples:

 n=0 Output:0 n=4 Output:100 n=27 Output:11011

Next step is to do the following:

Evaluate Arithmetic Expressions Requirements:

public class Evaluate { public static int expression(String str) { // return the value } } 

Implement a concrete ArrayStack class that extends the Stack interface as we discussed in the class (any other different Stack class implementation, even if it is implemented by yourself, will not receive any credit).

Write a method that evaluates an arithmatic expression, which is given by a string.

Your implementation is required to use the Stack interface we discussed in the class.

Write a necessary test program to verify the result. For example,

14-3*4+2*5-6*2 (should return 0) 

You may want to test all possible corner conditions to make sure your implement is inclusive.

Your implementation only considers +, - and * operators and does not need to consider parentheses.

Implementation should support parentheses. For example:

14-3*(4+2*(5-6))*2 (should return 2) 

Stack implementation format

public interface stack {

boolean isEmpty();

boolean isFull();

int size(); //this should return number of data elements

void push (Object item);

Object pop();

Object top();

}

public interfact stack {

boolean isEmpty();

boolean isFull();

int size(); //this should return number of data elements

void push (Object item);

Object pop();

Object top();

}

Array implementation Format

***************************

size()

return k+1

isEmpty()

return k==-1

isFull

return k==CAP-1

------------------

pop()

if (isEmpty()) then

retun null;

else

k=k-1

return Array[k+1]

-------------------

push()

if (isFull()) then

throw SomeException

else

Array[k] --- item

-------------------

top()

if (isEmpty()) then

return null

else

return Array[k];