1 2
3
PROCEDURE F(b, c)
{
val 0
REPEAT C TIMES
{
val val + b
4
5
6
7
8
RETURN val
9
}
10
11
12
13
14
15
16
PROCEDURE G(b, c)
{
count
val
REPEAT UNTIL ( val > b)
{
count count + 1
val
val + c
>
RETURN count
}
17
18
19
20
21
22
23
ans
+ F(3, 4) + G(35, 5)
DISPLAY (ans)
24

Write a method public static string getdigits(string phonenumber) that takes an 11-character phone number written with any combination of 11 uppercase letters, lowercase letters and/or digits, and zero or more hyphens, and which returns the digits that a person would have to press on a cell phone to dial that phone number. we will use the mapping of letters to digits given at en.wikipedia.org/wiki/telephone_keypad# /media/file: telephone-keypad2.svg you may assume that the string parameter phonenumber contains some combination of exactly 11 uppercase letters, lowercase letters and/or digits, but that any number of hyphens may be present. you can assume that a hyphen will not appear as the first or last character of the string. do not assum