15)Ray+Yan

code format="cpp"
 * 1) include
 * 2) include

using namespace std;

class stack {	private: int Top; char Array[6]; bool FULL, EMPTY; public: stack{ Top = 0; memset(Array, '\0', sizeof(Array)); FULL = false; EMPTY = true; }; ~stack{};

bool PUSH(char a){ if(Top == 5){ FULL = true; return false; }			Array[Top] = a;			Top++; EMPTY = false; return true; }		char POP{ if(!ISEMPTY){ char temp = Array[Top-1]; Array[Top-1] = '\0'; Top--; if(Top==0) EMPTY = true; FULL = false; return temp; }else{ printf("Stack empty. Nothing is found"); return '\n'; }		}		bool ISEMPTY{ return EMPTY; }		bool ISFULL{ return FULL; } }; int main{ stack mission; //removal of item from empty stack printf("---\nempty stack proof:\n---\n"); printf("%c", mission.POP); //pushing characters in	printf("---\nadding letters a-f:\n---\n"); for(int i = 0; i < 6; i++){ //stack not full if(mission.PUSH(char(i+97))) printf("'%c' added\n", char(i+97)); //stack full else printf("Stack is full, '%c' is not added\n", char(i+97)); }	printf("---\nremoving of elements demonstrating LIFO order:\n---\n"); while(!mission.ISEMPTY){ printf("'%c' has been removed from the stack\n", mission.POP); }	return 0; } code