Problem I: Consider the following alphabet: {0,1}

What are the languages generated by the following regular expressions:

1) (0| 1) 0

2) 00 | (10)*

3) (00| 10)*

Problem II:

1) Implement a C program that multiplies two matrices with dimension n x m and m x r (n, m, r are provided by the user as argument to the main function. The elements of the matrix are generated randomly. Test the program using putty.

example: matmult 2 3 4 will multiply two matrices of dimensions 2 x 3 and 3 x 4, the elements are generated randomly.

2) Determine the highest dimension(s) for which the program will crash

3) What solution do you propose to solve this problem?