Small monsters exhibit a fascinating social ordering behavior: within a given group of small monsters, when it comes time to enter a room (to be fed, to get ready to sleep, to participate in monstercise, etc.), the largest, strongest, most monstery monster in the group insists on entering the room last, and insists that the smallest, weakest, least monstery monster in the group be allowed to enter the room first. With the following structures defined:
struct monster_struct{
char *name;
double weight;
double monsteriness;
struct monster_struct *next;
struct monster_struct *prev;
}
typedef struct monster_struct monster;
typedef struct {
monster *head;
monster *tail;
} monster_list;
Write a function last_first_monsters() using the following prototype: void last_first_monsters(monster_list *ml);
That:
• Takes the lightest monster in the list and places it at the head of the list.
• Takes the heaviest monster in the list and places it at the tail of the list.