GET /cs453/index.htm1 HTTP/1.1Host: gai a.cs.umass.eduUser-Agent: Mozilla/5.0 ( Windows; U; Windows NT 5.1; en-US; rv:1.7.2) Gec ko/20040804 Netscape/7.2 (ax) Accept:ex t/xml, application/xml, application/xhtml+xml, text /html;q=0.9, text/plain;q=0.8, image/png,*/*;q=0.5 Accept-Language: en-us, en;q=0.5Accept- Encoding: zip, deflateAccept-Charset: ISO -8859-1, utf-8;q=0.7, *;q=0.7Keep-Alive: 300 Connection: keep-alive a. What is the URL of the document requested by the browser? b. What version of HTTP is the browser running? c. Does the browser request a non-persistent or a persistent connection?

Implement the function counter which takes in a string of words message, and returns a dictionary where each key is a word in the message, and each value is the number of times that word is present in the original string. def counter (message): """ Returns a dictionary of each word in message mapped to the number of times it appears in the input string. >>> X = counter('to be or not to be') >>> x['to'] 2 >>> x ['be'] 2 >>> x['not'] 1 >>> y = counter('run forrest run') >>> y['run'] 2 >>> y['forrest'] |||||| word_list = message.split() "*** YOUR CODE HERE ***"

Consider the following code segment. It is designed to identify the first location within a string, text where two adjacent characters are the same. i = 1 found = False while not found and i < len (text) : found = True else : i = i + 1 What line of code should be placed in the blank to achieve this goal? O a. if text[i] == text[i] : O b. if text[i] text[i 1] : 3%3D %3D O c. if text[i] == text[0] : O d. if text[i] == text[i + 1] :

Write down the NFA-epsilon to recognize all the strings with the following specification over the alphabet { 1, 2, 3, a, b, c }:   An acceptable string start with a header part including either 1, 2, or 3 with a following a, b, or c.   If, exactly, that number of symbols exists in the rest of the string, then the string is accepted. Otherwise, it is rejected. For instance, 2bac2c3acbdcba1ad is an acceptable string, since it starts with a header part 2b, and we have exactly two b symbols in the rest of the string. Header                  Rest   2b              ac2c3acbdcba1aa

Implement a Program that compresses strings in a simple way by counting repeated characters. The string aabcccccaa, for instance, would become a2blc5a3. Your function should return the original string if the "compressed" string did not end up being any smaller than the original string. You can assume that the string only contains characters in upper- and lowercase (a–z).

>>> message="The first setence is incorrect.">>> arr=message.split(i)   give an expression (using the message variable and slice syntax) that will evaluate to the substring "first"

Given a string containing only digits . Complete the function genlp() which returns a vector containing all the possible combinations of valid IPv4 IP addresses takes only the string as it's only argument.  Order doesn't matter a valid IP address must be in the form of A.B.C.D where A,B,C,D are numbers from 0 -255 these numbers cannot be prefixed unless they are 0. Please write the code in Java language .