Let G=(V,E) be an edge-labeled digraph, where the label of each edge is a basic sound from a given finite set of sounds ={S, S2, ..., Sn}. Let vobe a special node in G. The construct [G,vo, I] can be viewed as a formal model for speech recognition from a restricted vocabulary. Each path from nodevo yields a sequence of sounds < 0, 02, ...,ok > made up of the labels of the consecutive edges in the path; the concatenation of the sounds in that sequence is called the label of the path, and corresponds to a word in the restricted vocabulary. Such a path is called a o- labeled path. The determination of that word can be dictated by both the actual path and the end node of the path. Note that there could zero, one or more paths from vo having the same label o. Assume that in addition to the sound labels, each edge (x, y) has a non-negative probability p(x, y) of traversing the edge from x to y and producing the corresponding sound. The probability of a path is the product of probabilities of the edges of the path, and represents the probability that the corresponding word is produced by that sound sequence. The most likely word produced by a sound sequencen o is the word corresponding to the o-labeled path with the highest probability, starting from node vo a. Write a dynamic programming algorithm that takes as input a model [G,vo,] (along with the probabilities of the edges) and a sound sequence o = < 0, 02, ...,Ok > where every 0 E, and returns the highest probability o-labeled path that begins at node vo; if no such path exists, the algorithm returns null. b. Analyze the time complexity of your algorithm.