Cmpe 230 HW 2, Deadline Nov 3 200, 5pm

1) Suppose you are designing a program to play "pişti". Give the struct suitable
for representing a playing card (Think the game and the functions of the playing
card)

2) Given linked list designed as follows
typedef struct node *link;
struct node {Item item; link next;};

Write a function that moves the smallest element of this list to the first node
on the list.

3) Write a program that takes a string as argument and reads a sequence of words
(seperated by blank space ' ' and terminated by new line '\n') and prints out 
the the ones that are substrings of the argument string. 
An example is as follows

$./substr karabatak
dene baba ara aba bara kara kapak ata ak bakmak
Output is-> ara aba kara ata ak 
$

4) Write a program that takes a sequence of words as input and this time 
replaces the substrings of one or more blanks with exactly one blank. 
example is 
$./reducespace
a  aa aaa aaaa bb bbbb    bb   aa   a  a     a dd  d  d
Output is -> a aa aaa aaaa bb bbbb bb aa a a a dd d d
$