Answer Happy

in Java
public static class Deque<E> {
private E[] data;
private int f, size, capacity;
/* P3. [6 x 2 pt] Implement
Deque
*/
public Deque(int cap) {
data = (E[]) new
Object[cap];
capacity = cap; f = 0;
size = 0;
}
public Deque()
{ this(256); }
public boolean isEmpty() { return size
== 0; }
public int size()
{ return size; }
public E first() {
//1. TODO implement
first

}
public E last() {
//2. TODO implement
last

}
public void addFirst(E e) {
//3. TODO implement
addFirst
}
public void addLast(E e) {
//4. TODO implement
addLast
}
public E removeFirst() {
//5. TODO implement
removeFirst
}
public E removeLast() {
//6. TODO implement
removeLast
}
}