The objective of this exercise is to find the largest input size n that an algorithm a with time complexity f(n) can handle in one year. we assume that f(n) is expressed in milliseconds. if f(n)= e^n, then algorithm a can handle in a year a problem of size n up to:

try a gofundme or ask your family for money slowly and slowly then save it or do trades on craigslist. that's all i know

do not use any of these common illegal characters/symbols:

# pound

% percent

& ampersand

{ left curly bracket

} right curly bracket

\ back slash

< left angle bracket

> right angle bracket

* asterisk

? question mark

/ forward slash

  blank spaces

$ dollar sign

! exclamation point

' single quotes

" double quotes

: colon

@ at sign