HW2 Rubric 1. 9 pts 2 pts: Print stations correctly. 2 pts: Print schedules correctly. 2 pts: Print route results correctly. 2 pts: valgrind reports no memory errors (must've done some work). 1 pt: Did some work. NOTE: If you modified trains.h, you probably have a one for this problem because we didn't get your modifications. A post on Piazza emailed out to everyone later on (possibly after the midterm) will give instructions on what to do. 2. 4 pts Full credit if pass test cases AND used recursion. 2 pts for passing test cases only (didn't use recursion). If answers incorrect, points for attempting recursion: 1 pt for "jal findMax" in the function. 1 pt for saving $ra on the stack. 3. 2 pts Full credit if idea seems correct. Mentions string representation of $a0 or null terminating array of chars of '1' or '0' representing bits of $a0. 1 pt if only describes the code (like explaining each instruction) but not what it's doing overall. 4. 5 pts 1 pt for matching one char substrings. 2 pts for matching substrings with multiple characters. 2 pts for matching substrings that can overlap in the string.