ESc101 Laboratory Assignment 
		Monday of Week of 20/09/04


The Assignment consists of THREE programs. USE OF ARRAYS IS NOT ALLOWED.


1) Given a string, return a string sorted according to the characters' ASCII values.      
Use objects of StringBuffer Class. (String Class represents fixed-length, immutable 
character sequences. In contrast, StringBuffer Class represents growable and writable 
character sequences.) Bubble-Sort Algorithm might be used. 
The algorithm is as follows : Consecutive characters in the string are compared from 
left to right and in case the earlier character is greater than the latter one, the 2 
characters are swapped. This is done repeatedly till no more characters need to be swapped. 

For example : suppose the string is initially  "adgekofwqmc"
	      After 1st iteration : "adegkfoqmcw"
	      After 2nd iteration : "adegfkomcqw"
	      After 3rd iteration : "adefgkmcoqw"
	      After 4th iteration : "adefgkcmoqw" .. and so on


2) You are given 2 strings str1 and str2. Check if all the characters in str2 occur in 
str1 or not. The ordering of the characters may or may not be the same.

3) For an integer n, compute the set of numbers which are relatively prime to n 
and are less than n.