public class Bitset implements Set{ private boolean set[]; public Bitset(){ set = new boolean[max]; } public void add(int num){ set[num]=true; } public void display(){ System.out.print("{"); for(int i=0;i<max;i++){ if(set[i]==true) System.out.print(" " + i); } System.out.println("}"); } public Set union(Set s){ Set s1 = new Bitset(); for(int i=0;i<max;i++){ ((Bitset)s1).set[i]=this.set[i]||((Bitset)s).set[i]; } return s1; } public Set intersection(Set s); public Set difference(Set s); public boolean subset(Set s); public boolean disjoint(Set s); public int cardinality(); public static void main(String[] args){ Set bitset = new Bitset(); bitset.add(5); bitset.display(); } } .