Commit 1fd617c

@@ -4,6 +4,12 @@ Name: Mo Khan
 Student ID: 3431709
 
 1. Problem Statement:
+
+Design and implement a MinStack data structure that can store comparable elements and supports the stack operations `push(x)`, `pop()`, and `size()`,
+as well as the `min()` operation, which returns the minimum value currently stored in the data structure.
+
+All operations should run in constant time.
+
 2. Description of the Code:
 3. Errors and Warnings:
 4. Sample Input and Output:

@@ -0,0 +1,15 @@
+# Learning Profile for Assignment #1 - Question #1b - Computer Science 272: Data Structures and Algorithms
+
+Name: Mo Khan
+Student ID: 3431709
+
+1. Problem Statement:
+
+Implement the stack methods `push(x)` and `pop()` using two queues.
+
+Analyze the running time of the push(x) and pop() operations based on this implementation.
+
+2. Description of the Code:
+3. Errors and Warnings:
+4. Sample Input and Output:
+5. Discussion: