Your tasks: Complete count_ones function. You are given a 32-bits integer stored in $t0. Count the number of 1's in the given number. For example, 1111 0000 should return 4 Complete swap_bits function which swaps bits at odd and even positions of an integer (32 bits). In other words, every even position bit is swapped with the adjacent bit on the right side, and every odd position bit is swapped with the adjacent on the left side. For instance, bits 0 and 1 are swapped, bits 2 and 3 are swapped, and so on. It is not recommended to use loops or conditional statements for this part. Example: if the given number is 23 (00010111), it should be converted to 43 (00101011). Note this example, we only use the lower 8 bits of a number, but your program will work on 32-bit numbers.