Create a function that takes an integer array as input and a value and returns a POINTER to the number of times the value appears in the integer array, zero if it does not appear in the array. Use pointer arithmetic to work through the array (don't use the [ ] operator)

Consider a list of full names formatted “firstname lastname”, like ["jules verne", "alexandre dumas", "maurice druon"]. write a list comprehension that produces a list with the full names in the format “lastname, firstname”. the resulting list should look like ['verne, jules', 'dumas, alexandre', 'druon, maurice']. the simplest solution may involve a nested comprehension: [ …. for … in [ … for … in … ]].