1011.1011 (base 2) = (base 10)

Q#8, Recursive letter: Given the following recursive function: 1 def love_letter(n):2 ifn<1:3 print('I Love CS5001 - Yes I do!!!') 4 else: 5       print('Roses are Red, Violets are Blue') 6          love_letter(n - 1)   Identify the code lines that contain the base case and describe its purpose How would you modify this code to produce infinite recursion? Write a version of this code that will run forever and/or generate a RecursionError while still printing each message from line 3 and 5 at least once.

C Programming What does the below code segment do? #define RECORD_LENGTH 60 /* PORTFOLIO.DAT looks like the below: ibm 108.77 27.98 att 111.43 50 acdc 100 30 */   void main(void) { FILE *fptr; char stock_price_shares[RECORD_LENGTH + 1]; int i=0, count=0; // attempt to open PORTFOLIO.DAT for reading   if ((fptr = fopen("PORTFOLIO.DAT", "r")) == NULL) printf("\nCannot open the file: PORTFOLIO.DAT\n"); else { while ( fgets(stock_price_shares, RECORD_LENGTH + 1, fptr) != NULL ) printf("\n%s", stock_price_shares); fclose(fptr); //close the file }   printf("\nHow many new records for PORTFOLIO.DAT?"); scanf("%d ", &count); fptr = fopen("PORTFOLIO. DAT", "w"); /* writing */ for (i = 0; i < count; ++i) { gets(stock_price_shares); fputs(stock_price_shares, fptr); fclose(fptr); } }

/*** Define string that prints correctly formatted multiplication table with* header and column prefix. Add --- and | delimiters between prefix and* table data** You may assume table has at least 1 row with 1 element** Use System.lineSeparator() to delimit individual lines** <pre>| 0, 1, 2, 3, 4, 5---------------------------0| 01| 0, 12| 0, 2, 43| 0, 3, 6, 94| 0, 4, 8, 12, 165| 0, 5, 10, 15, 20, 25* </pre>** @param table* 2D array of integers (not rectangular!)* @return String as formatted multiplication table*/public static String tableToString(int[][] table) {